./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.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 d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:07:37,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:07:37,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:07:37,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:07:37,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:07:37,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:07:37,194 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:07:37,194 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:07:37,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:07:37,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:07:37,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:07:37,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:07:37,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:07:37,197 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:07:37,197 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:07:37,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:07:37,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:07:37,198 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:07:37,198 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:07:37,198 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:07:37,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:07:37,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:07:37,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:37,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:07:37,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:07:37,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:07:37,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:07:37,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:07:37,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:07:37,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:07:37,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:07:37,205 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 -> d7e3ed8389d85579f25ce07510934446f3151103b0f238999e98597cb70459b5 [2024-10-13 04:07:37,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:07:37,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:07:37,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:07:37,414 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:07:37,414 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:07:37,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-10-13 04:07:38,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:07:38,809 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:07:38,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-10-13 04:07:38,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33f3043f/3d1dcac5281e4f4a996e05cba2f1a052/FLAG12c6fd9fa [2024-10-13 04:07:39,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a33f3043f/3d1dcac5281e4f4a996e05cba2f1a052 [2024-10-13 04:07:39,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:07:39,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:07:39,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:39,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:07:39,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:07:39,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17020d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39, skipping insertion in model container [2024-10-13 04:07:39,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:07:39,371 WARN L248 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_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2024-10-13 04:07:39,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:39,411 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:07:39,421 WARN L248 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_loopvsstraightlinecode_25-1loop_file-34.i[915,928] [2024-10-13 04:07:39,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:07:39,452 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:07:39,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39 WrapperNode [2024-10-13 04:07:39,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:07:39,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:39,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:07:39,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:07:39,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,538 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 93 [2024-10-13 04:07:39,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:07:39,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:07:39,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:07:39,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:07:39,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,571 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-10-13 04:07:39,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:07:39,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:07:39,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:07:39,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:07:39,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (1/1) ... [2024-10-13 04:07:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:07:39,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:39,631 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-10-13 04:07:39,636 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-10-13 04:07:39,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:07:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:07:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:07:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:07:39,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:07:39,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:07:39,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:07:39,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:07:39,925 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-13 04:07:39,925 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:07:39,953 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:07:39,953 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:07:39,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:39 BoogieIcfgContainer [2024-10-13 04:07:39,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:07:39,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:07:39,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:07:39,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:07:39,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:07:39" (1/3) ... [2024-10-13 04:07:39,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2874719b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:39, skipping insertion in model container [2024-10-13 04:07:39,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:07:39" (2/3) ... [2024-10-13 04:07:39,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2874719b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:07:39, skipping insertion in model container [2024-10-13 04:07:39,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:39" (3/3) ... [2024-10-13 04:07:39,960 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-34.i [2024-10-13 04:07:39,973 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:07:39,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:07:40,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:07:40,041 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;@3e164ffc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:07:40,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:07:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:07:40,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 04:07:40,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:40,053 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:40,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:40,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1387386125, now seen corresponding path program 1 times [2024-10-13 04:07:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097929375] [2024-10-13 04:07:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097929375] [2024-10-13 04:07:40,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097929375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:40,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:07:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947388826] [2024-10-13 04:07:40,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:07:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:40,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:07:40,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:07:40,343 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:07:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:40,373 INFO L93 Difference]: Finished difference Result 65 states and 106 transitions. [2024-10-13 04:07:40,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:07:40,377 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2024-10-13 04:07:40,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:40,382 INFO L225 Difference]: With dead ends: 65 [2024-10-13 04:07:40,383 INFO L226 Difference]: Without dead ends: 31 [2024-10-13 04:07:40,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-10-13 04:07:40,390 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:40,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-13 04:07:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-13 04:07:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-13 04:07:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-13 04:07:40,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2024-10-13 04:07:40,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:40,419 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-13 04:07:40,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-13 04:07:40,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-13 04:07:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 04:07:40,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:40,423 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:07:40,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1345174155, now seen corresponding path program 1 times [2024-10-13 04:07:40,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113684495] [2024-10-13 04:07:40,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:42,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:42,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:42,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113684495] [2024-10-13 04:07:42,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113684495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:42,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:42,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:07:42,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040307729] [2024-10-13 04:07:42,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:07:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:42,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:07:42,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:07:42,368 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:42,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:42,578 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-10-13 04:07:42,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:07:42,579 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2024-10-13 04:07:42,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:42,580 INFO L225 Difference]: With dead ends: 85 [2024-10-13 04:07:42,581 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 04:07:42,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:42,585 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:42,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 140 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 04:07:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2024-10-13 04:07:42,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-13 04:07:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-10-13 04:07:42,608 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2024-10-13 04:07:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:42,609 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-10-13 04:07:42,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-10-13 04:07:42,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 04:07:42,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:42,612 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:07:42,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:42,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:42,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1345114573, now seen corresponding path program 1 times [2024-10-13 04:07:42,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354743844] [2024-10-13 04:07:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:42,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:43,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:43,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:43,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354743844] [2024-10-13 04:07:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354743844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:43,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:43,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 04:07:43,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689909518] [2024-10-13 04:07:43,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:43,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:07:43,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:07:43,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:07:43,421 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:43,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:43,665 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2024-10-13 04:07:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 04:07:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2024-10-13 04:07:43,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:43,667 INFO L225 Difference]: With dead ends: 161 [2024-10-13 04:07:43,667 INFO L226 Difference]: Without dead ends: 159 [2024-10-13 04:07:43,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:07:43,669 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 77 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:43,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 181 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:07:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-13 04:07:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2024-10-13 04:07:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.247191011235955) internal successors, (111), 89 states have internal predecessors, (111), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 04:07:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-10-13 04:07:43,705 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 59 [2024-10-13 04:07:43,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:43,706 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-10-13 04:07:43,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-10-13 04:07:43,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:07:43,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:43,708 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:43,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:07:43,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:43,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2046131806, now seen corresponding path program 1 times [2024-10-13 04:07:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:43,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430034293] [2024-10-13 04:07:43,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:43,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:43,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430034293] [2024-10-13 04:07:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430034293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:43,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:43,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:07:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670204768] [2024-10-13 04:07:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:07:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:43,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:07:43,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:07:43,814 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:43,868 INFO L93 Difference]: Finished difference Result 312 states and 427 transitions. [2024-10-13 04:07:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:07:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-10-13 04:07:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:43,870 INFO L225 Difference]: With dead ends: 312 [2024-10-13 04:07:43,870 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 04:07:43,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:43,872 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:43,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 04:07:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 155. [2024-10-13 04:07:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-13 04:07:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2024-10-13 04:07:43,889 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 60 [2024-10-13 04:07:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:43,889 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2024-10-13 04:07:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2024-10-13 04:07:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:07:43,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:43,891 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:43,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:07:43,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -271124444, now seen corresponding path program 1 times [2024-10-13 04:07:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:43,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145663696] [2024-10-13 04:07:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:43,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145663696] [2024-10-13 04:07:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145663696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:43,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:07:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083773474] [2024-10-13 04:07:43,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:07:43,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:07:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:07:43,989 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:44,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:44,069 INFO L93 Difference]: Finished difference Result 371 states and 503 transitions. [2024-10-13 04:07:44,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:07:44,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-10-13 04:07:44,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:44,072 INFO L225 Difference]: With dead ends: 371 [2024-10-13 04:07:44,072 INFO L226 Difference]: Without dead ends: 237 [2024-10-13 04:07:44,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:44,075 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:44,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 121 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:44,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-13 04:07:44,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2024-10-13 04:07:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 04:07:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2024-10-13 04:07:44,126 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2024-10-13 04:07:44,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2024-10-13 04:07:44,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:44,127 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2024-10-13 04:07:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:07:44,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:44,128 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:07:44,128 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:44,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1010277305, now seen corresponding path program 1 times [2024-10-13 04:07:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781187873] [2024-10-13 04:07:44,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:45,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-13 04:07:45,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:45,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781187873] [2024-10-13 04:07:45,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781187873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:45,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:07:45,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:07:45,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654675901] [2024-10-13 04:07:45,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:45,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 04:07:45,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:45,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 04:07:45,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 04:07:45,267 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:45,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:45,440 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2024-10-13 04:07:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:07:45,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2024-10-13 04:07:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:45,445 INFO L225 Difference]: With dead ends: 292 [2024-10-13 04:07:45,445 INFO L226 Difference]: Without dead ends: 207 [2024-10-13 04:07:45,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:45,448 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:45,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-13 04:07:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2024-10-13 04:07:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 04:07:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2024-10-13 04:07:45,473 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2024-10-13 04:07:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2024-10-13 04:07:45,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-13 04:07:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2024-10-13 04:07:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 04:07:45,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:45,475 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 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-10-13 04:07:45,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 04:07:45,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:45,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1012124347, now seen corresponding path program 1 times [2024-10-13 04:07:45,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:45,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112861748] [2024-10-13 04:07:45,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:45,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:07:45,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112861748] [2024-10-13 04:07:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112861748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:07:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567654079] [2024-10-13 04:07:45,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:45,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:45,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:07:45,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:07:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:45,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:07:45,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:07:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-13 04:07:45,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:07:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-13 04:07:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567654079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:07:45,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 04:07:45,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-13 04:07:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81042561] [2024-10-13 04:07:45,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 04:07:45,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:07:45,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:45,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:07:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:07:45,845 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:07:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:45,972 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2024-10-13 04:07:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 04:07:45,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 60 [2024-10-13 04:07:45,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:45,975 INFO L225 Difference]: With dead ends: 286 [2024-10-13 04:07:45,975 INFO L226 Difference]: Without dead ends: 111 [2024-10-13 04:07:45,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-13 04:07:45,977 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:45,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 55 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:07:45,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-13 04:07:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-10-13 04:07:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-13 04:07:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2024-10-13 04:07:45,991 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2024-10-13 04:07:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:45,992 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2024-10-13 04:07:45,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:07:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2024-10-13 04:07:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 04:07:45,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:07:45,998 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:46,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:07:46,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:46,200 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:07:46,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:07:46,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1935994354, now seen corresponding path program 1 times [2024-10-13 04:07:46,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:07:46,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537336873] [2024-10-13 04:07:46,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:46,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:07:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:07:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:07:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:07:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:07:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:07:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:07:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:07:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:07:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:07:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 04:07:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 04:07:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 04:07:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 04:07:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 04:07:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 04:07:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 04:07:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 04:07:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 04:07:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-13 04:07:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:07:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537336873] [2024-10-13 04:07:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537336873] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 04:07:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727991599] [2024-10-13 04:07:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:07:46,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:07:46,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:07:46,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:07:46,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:07:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:07:46,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:07:46,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:07:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-13 04:07:46,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:07:46,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727991599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:07:46,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 04:07:46,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-10-13 04:07:46,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478983485] [2024-10-13 04:07:46,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:07:46,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:07:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:07:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:07:46,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:46,424 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:07:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:07:46,447 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2024-10-13 04:07:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:07:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2024-10-13 04:07:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:07:46,448 INFO L225 Difference]: With dead ends: 134 [2024-10-13 04:07:46,448 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 04:07:46,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:07:46,449 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:07:46,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:07:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 04:07:46,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 04:07:46,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 04:07:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 04:07:46,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2024-10-13 04:07:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:07:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 04:07:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-10-13 04:07:46,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 04:07:46,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 04:07:46,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:07:46,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:07:46,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-13 04:07:46,657 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:07:46,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 04:07:47,298 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:07:47,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:07:47 BoogieIcfgContainer [2024-10-13 04:07:47,311 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:07:47,311 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:07:47,311 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:07:47,312 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:07:47,312 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:07:39" (3/4) ... [2024-10-13 04:07:47,314 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 04:07:47,316 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 04:07:47,319 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 04:07:47,319 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 04:07:47,320 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 04:07:47,320 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 04:07:47,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 04:07:47,393 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 04:07:47,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:07:47,394 INFO L158 Benchmark]: Toolchain (without parser) took 8180.74ms. Allocated memory was 201.3MB in the beginning and 362.8MB in the end (delta: 161.5MB). Free memory was 134.4MB in the beginning and 223.3MB in the end (delta: -88.9MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,394 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:07:47,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.76ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 120.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.76ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 174.3MB in the end (delta: -53.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,395 INFO L158 Benchmark]: Boogie Preprocessor took 50.00ms. Allocated memory is still 201.3MB. Free memory was 174.3MB in the beginning and 171.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,395 INFO L158 Benchmark]: RCFGBuilder took 359.46ms. Allocated memory is still 201.3MB. Free memory was 171.4MB in the beginning and 154.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,395 INFO L158 Benchmark]: TraceAbstraction took 7355.26ms. Allocated memory was 201.3MB in the beginning and 362.8MB in the end (delta: 161.5MB). Free memory was 153.8MB in the beginning and 228.5MB in the end (delta: -74.7MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,396 INFO L158 Benchmark]: Witness Printer took 82.25ms. Allocated memory is still 362.8MB. Free memory was 228.5MB in the beginning and 223.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 04:07:47,397 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.76ms. Allocated memory is still 201.3MB. Free memory was 134.2MB in the beginning and 120.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.76ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 174.3MB in the end (delta: -53.7MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.00ms. Allocated memory is still 201.3MB. Free memory was 174.3MB in the beginning and 171.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.46ms. Allocated memory is still 201.3MB. Free memory was 171.4MB in the beginning and 154.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7355.26ms. Allocated memory was 201.3MB in the beginning and 362.8MB in the end (delta: 161.5MB). Free memory was 153.8MB in the beginning and 228.5MB in the end (delta: -74.7MB). Peak memory consumption was 192.1MB. Max. memory is 16.1GB. * Witness Printer took 82.25ms. Allocated memory is still 362.8MB. Free memory was 228.5MB in the beginning and 223.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 8, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 846 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 533 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 313 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 423 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 177 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 2273 SizeOfPredicates, 2 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 2525/2562 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((var_1_5 == 0) && (0 <= k_loop)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (var_1_11 <= 0)) || ((((1 <= k_loop) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (var_1_11 <= 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((last_1_var_1_5 <= 0) && (var_1_5 == 0)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (0 <= 0)) Ensures: ((((((cond != 0) && (last_1_var_1_5 <= 0)) && (var_1_5 == 0)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (0 <= 0)) RESULT: Ultimate proved your program to be correct! [2024-10-13 04:07:47,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE