./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1123f6113f06d17f462c885d49081665f821b5af861fd1db9616aecb6705c7c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:52:11,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:52:11,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:52:11,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:52:11,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:52:11,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:52:11,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:52:11,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:52:11,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:52:11,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:52:11,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:52:11,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:52:11,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:52:11,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:52:11,984 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:52:11,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:52:11,985 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:52:11,985 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:52:11,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:52:11,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:52:11,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:52:11,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:52:11,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:52:11,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:52:11,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:52:11,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:52:11,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:52:11,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:52:11,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:52:11,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:52:11,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:52:11,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:52:11,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:52:11,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:52:11,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:52:11,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:52:11,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:52:11,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:52:11,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:52:11,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:52:11,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:52:11,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:52:11,994 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1123f6113f06d17f462c885d49081665f821b5af861fd1db9616aecb6705c7c4 [2024-11-16 15:52:12,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:52:12,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:52:12,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:52:12,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:52:12,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:52:12,228 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i [2024-11-16 15:52:13,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:52:13,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:52:13,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i [2024-11-16 15:52:13,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67cb45906/83d211a39304462cad330bde3853b15d/FLAG5ffda1d6e [2024-11-16 15:52:13,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67cb45906/83d211a39304462cad330bde3853b15d [2024-11-16 15:52:13,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:52:13,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:52:13,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:52:13,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:52:13,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:52:13,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:13" (1/1) ... [2024-11-16 15:52:13,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145ad35a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:13, skipping insertion in model container [2024-11-16 15:52:13,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:52:13" (1/1) ... [2024-11-16 15:52:13,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:52:13,942 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i[916,929] [2024-11-16 15:52:13,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:52:14,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:52:14,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i[916,929] [2024-11-16 15:52:14,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:52:14,063 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:52:14,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14 WrapperNode [2024-11-16 15:52:14,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:52:14,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:52:14,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:52:14,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:52:14,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,078 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,103 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-16 15:52:14,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:52:14,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:52:14,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:52:14,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:52:14,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,137 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:52:14,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,149 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:52:14,151 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:52:14,151 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:52:14,151 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:52:14,154 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (1/1) ... [2024-11-16 15:52:14,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:52:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:52:14,189 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:52:14,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:52:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:52:14,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:52:14,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:52:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:52:14,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:52:14,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:52:14,308 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:52:14,312 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:52:14,567 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 15:52:14,568 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:52:14,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:52:14,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:52:14,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:52:14 BoogieIcfgContainer [2024-11-16 15:52:14,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:52:14,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:52:14,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:52:14,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:52:14,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:52:13" (1/3) ... [2024-11-16 15:52:14,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e5dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:14, skipping insertion in model container [2024-11-16 15:52:14,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:52:14" (2/3) ... [2024-11-16 15:52:14,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e5dfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:52:14, skipping insertion in model container [2024-11-16 15:52:14,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:52:14" (3/3) ... [2024-11-16 15:52:14,605 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-68.i [2024-11-16 15:52:14,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:52:14,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:52:14,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:52:14,679 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@63dc8c00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:52:14,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:52:14,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:52:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 15:52:14,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:14,695 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:14,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:14,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1080559349, now seen corresponding path program 1 times [2024-11-16 15:52:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580822253] [2024-11-16 15:52:14,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:14,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:14,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:14,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:14,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:14,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:52:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:52:15,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:52:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:52:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:52:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:52:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:52:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:52:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:52:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:52:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:52:15,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:15,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580822253] [2024-11-16 15:52:15,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580822253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:15,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:15,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:52:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237332112] [2024-11-16 15:52:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:15,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:52:15,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:15,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:52:15,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:52:15,131 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:52:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:15,158 INFO L93 Difference]: Finished difference Result 114 states and 194 transitions. [2024-11-16 15:52:15,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:52:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2024-11-16 15:52:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:15,169 INFO L225 Difference]: With dead ends: 114 [2024-11-16 15:52:15,170 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:52:15,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:52:15,177 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:15,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:52:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:52:15,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:52:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2024-11-16 15:52:15,257 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 132 [2024-11-16 15:52:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:15,258 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 82 transitions. [2024-11-16 15:52:15,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:52:15,258 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 82 transitions. [2024-11-16 15:52:15,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 15:52:15,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:15,269 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:15,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:52:15,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:15,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:15,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2121027158, now seen corresponding path program 1 times [2024-11-16 15:52:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:15,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081083158] [2024-11-16 15:52:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:15,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:52:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:52:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:52:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:52:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:52:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:52:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:52:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:52:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:52:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:52:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:52:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081083158] [2024-11-16 15:52:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081083158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:15,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:15,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:52:15,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112761928] [2024-11-16 15:52:15,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:15,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:52:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:52:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:15,553 INFO L87 Difference]: Start difference. First operand 56 states and 82 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:52:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:15,580 INFO L93 Difference]: Finished difference Result 109 states and 161 transitions. [2024-11-16 15:52:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:52:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-16 15:52:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:15,585 INFO L225 Difference]: With dead ends: 109 [2024-11-16 15:52:15,586 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 15:52:15,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:52:15,587 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:15,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:52:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 15:52:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 15:52:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:52:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-16 15:52:15,595 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 132 [2024-11-16 15:52:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:15,597 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-16 15:52:15,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:52:15,597 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-16 15:52:15,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 15:52:15,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:15,600 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:52:15,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash 366485675, now seen corresponding path program 1 times [2024-11-16 15:52:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:15,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091860531] [2024-11-16 15:52:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:52:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:52:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:52:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:52:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:52:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:52:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:52:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:52:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:52:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:52:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:52:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:52:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 15:52:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 15:52:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 15:52:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 15:52:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 15:52:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 15:52:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 15:52:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 15:52:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 15:52:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:52:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:52:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:52:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091860531] [2024-11-16 15:52:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091860531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:52:48,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:52:48,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:52:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604327195] [2024-11-16 15:52:48,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:52:48,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:52:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:52:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:52:48,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:52:48,517 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:52:50,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:52:50,257 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2024-11-16 15:52:50,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:52:50,258 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-16 15:52:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:52:50,260 INFO L225 Difference]: With dead ends: 89 [2024-11-16 15:52:50,260 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 15:52:50,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:52:50,261 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 42 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:52:50,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 345 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:52:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 15:52:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2024-11-16 15:52:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:52:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2024-11-16 15:52:50,270 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 132 [2024-11-16 15:52:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:52:50,270 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2024-11-16 15:52:50,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:52:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2024-11-16 15:52:50,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 15:52:50,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:52:50,272 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:52:50,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:52:50,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:52:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:52:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash 395114826, now seen corresponding path program 1 times [2024-11-16 15:52:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:52:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329626202] [2024-11-16 15:52:50,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:52:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:52:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat