./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c --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/recursive/recHanoi03-2.c -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 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:43:36,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:43:36,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:43:36,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:43:36,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:43:36,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:43:36,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:43:36,301 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:43:36,301 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:43:36,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:43:36,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:43:36,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:43:36,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:43:36,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:43:36,306 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:43:36,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:43:36,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:43:36,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:43:36,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:43:36,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:43:36,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:43:36,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:43:36,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:43:36,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:43:36,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:43:36,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:43:36,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:43:36,314 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:43:36,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:43:36,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:43:36,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:43:36,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:43:36,316 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 -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 [2024-10-12 19:43:36,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:43:36,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:43:36,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:43:36,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:43:36,513 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:43:36,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-10-12 19:43:37,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:43:37,857 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:43:37,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-10-12 19:43:37,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5172c47/6224e137761d459a9a11c2403d1f8a4f/FLAGe2ee15a23 [2024-10-12 19:43:37,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5172c47/6224e137761d459a9a11c2403d1f8a4f [2024-10-12 19:43:37,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:43:37,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:43:37,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:43:37,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:43:37,884 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:43:37,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:43:37" (1/1) ... [2024-10-12 19:43:37,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fddaf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:37, skipping insertion in model container [2024-10-12 19:43:37,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:43:37" (1/1) ... [2024-10-12 19:43:37,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:43:38,044 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/recursive/recHanoi03-2.c[769,782] [2024-10-12 19:43:38,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:43:38,060 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:43:38,073 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/recursive/recHanoi03-2.c[769,782] [2024-10-12 19:43:38,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:43:38,089 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:43:38,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38 WrapperNode [2024-10-12 19:43:38,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:43:38,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:43:38,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:43:38,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:43:38,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,114 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2024-10-12 19:43:38,114 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:43:38,115 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:43:38,115 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:43:38,115 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:43:38,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,125 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,133 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-12 19:43:38,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,139 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:43:38,143 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:43:38,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:43:38,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:43:38,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (1/1) ... [2024-10-12 19:43:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:43:38,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:43:38,180 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-12 19:43:38,183 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-12 19:43:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:43:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-10-12 19:43:38,220 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-10-12 19:43:38,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:43:38,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:43:38,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:43:38,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:43:38,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:43:38,363 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-12 19:43:38,363 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:43:38,385 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:43:38,386 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 19:43:38,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:43:38 BoogieIcfgContainer [2024-10-12 19:43:38,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:43:38,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:43:38,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:43:38,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:43:38,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:43:37" (1/3) ... [2024-10-12 19:43:38,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da1f473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:43:38, skipping insertion in model container [2024-10-12 19:43:38,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:43:38" (2/3) ... [2024-10-12 19:43:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da1f473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:43:38, skipping insertion in model container [2024-10-12 19:43:38,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:43:38" (3/3) ... [2024-10-12 19:43:38,395 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2024-10-12 19:43:38,407 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:43:38,408 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:43:38,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:43:38,462 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;@542d54fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:43:38,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:43:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 19:43:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-12 19:43:38,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:43:38,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:43:38,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:43:38,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:43:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1546859687, now seen corresponding path program 1 times [2024-10-12 19:43:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:43:38,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357985114] [2024-10-12 19:43:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:43:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:38,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:43:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:43:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357985114] [2024-10-12 19:43:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357985114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:43:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:43:38,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:43:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038516646] [2024-10-12 19:43:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:43:38,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:43:38,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:43:38,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:43:38,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:43:38,835 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:43:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:43:38,943 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-10-12 19:43:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:43:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-10-12 19:43:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:43:38,951 INFO L225 Difference]: With dead ends: 23 [2024-10-12 19:43:38,951 INFO L226 Difference]: Without dead ends: 15 [2024-10-12 19:43:38,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:43:38,956 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:43:38,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:43:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-12 19:43:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-12 19:43:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 19:43:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-12 19:43:39,022 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2024-10-12 19:43:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:43:39,024 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-12 19:43:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 19:43:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-12 19:43:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 19:43:39,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:43:39,025 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:43:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:43:39,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:43:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:43:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -797183849, now seen corresponding path program 1 times [2024-10-12 19:43:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:43:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068652550] [2024-10-12 19:43:39,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:43:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:39,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:43:39,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:43:39,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068652550] [2024-10-12 19:43:39,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068652550] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:43:39,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711932378] [2024-10-12 19:43:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:39,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:43:39,285 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-12 19:43:39,286 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-12 19:43:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:39,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:43:39,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:43:39,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:43:39,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:43:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:43:39,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711932378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:43:39,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:43:39,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-10-12 19:43:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506960205] [2024-10-12 19:43:39,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:43:39,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-12 19:43:39,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:43:39,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-12 19:43:39,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:43:39,804 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 19:43:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:43:39,934 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-12 19:43:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:43:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 16 [2024-10-12 19:43:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:43:39,936 INFO L225 Difference]: With dead ends: 27 [2024-10-12 19:43:39,936 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 19:43:39,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:43:39,937 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:43:39,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:43:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 19:43:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-12 19:43:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:43:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-12 19:43:39,945 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-10-12 19:43:39,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:43:39,946 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-12 19:43:39,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-10-12 19:43:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-12 19:43:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-12 19:43:39,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:43:39,948 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:43:39,960 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-12 19:43:40,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:40,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:43:40,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:43:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1671831511, now seen corresponding path program 2 times [2024-10-12 19:43:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:43:40,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072008540] [2024-10-12 19:43:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:43:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:40,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:40,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:43:40,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:43:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072008540] [2024-10-12 19:43:40,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072008540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:43:40,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141276577] [2024-10-12 19:43:40,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:43:40,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:40,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:43:40,510 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-12 19:43:40,511 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-12 19:43:40,545 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:43:40,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:43:40,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 19:43:40,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:43:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:43:40,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:43:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:43:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141276577] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:43:41,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:43:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 31 [2024-10-12 19:43:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784425371] [2024-10-12 19:43:41,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:43:41,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-12 19:43:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:43:41,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-12 19:43:41,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-10-12 19:43:41,676 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-12 19:43:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:43:41,946 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-10-12 19:43:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-12 19:43:41,946 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) Word has length 28 [2024-10-12 19:43:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:43:41,947 INFO L225 Difference]: With dead ends: 36 [2024-10-12 19:43:41,948 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 19:43:41,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2024-10-12 19:43:41,949 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:43:41,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 135 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:43:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 19:43:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-12 19:43:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:43:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-10-12 19:43:41,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2024-10-12 19:43:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:43:41,960 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-10-12 19:43:41,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 21 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 9 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-12 19:43:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-10-12 19:43:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:43:41,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:43:41,961 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:43:41,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:43:42,165 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,SelfDestructingSolverStorable2 [2024-10-12 19:43:42,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:43:42,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:43:42,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1245455975, now seen corresponding path program 3 times [2024-10-12 19:43:42,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:43:42,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035635799] [2024-10-12 19:43:42,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:42,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:43:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-10-12 19:43:42,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:43:42,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035635799] [2024-10-12 19:43:42,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035635799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:43:42,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613024416] [2024-10-12 19:43:42,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:43:42,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:42,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:43:42,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:43:42,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-12 19:43:42,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-10-12 19:43:42,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:43:42,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 19:43:42,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:43:43,128 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-12 19:43:43,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:43:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 19:43:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613024416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:43:45,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:43:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 24] total 46 [2024-10-12 19:43:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348093450] [2024-10-12 19:43:45,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:43:45,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-10-12 19:43:45,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:43:45,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-10-12 19:43:45,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2024-10-12 19:43:45,975 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-12 19:43:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:43:46,410 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-12 19:43:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-12 19:43:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) Word has length 46 [2024-10-12 19:43:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:43:46,411 INFO L225 Difference]: With dead ends: 54 [2024-10-12 19:43:46,411 INFO L226 Difference]: Without dead ends: 48 [2024-10-12 19:43:46,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=631, Invalid=3925, Unknown=0, NotChecked=0, Total=4556 [2024-10-12 19:43:46,415 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:43:46,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:43:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-12 19:43:46,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-12 19:43:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:43:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2024-10-12 19:43:46,426 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2024-10-12 19:43:46,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:43:46,427 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2024-10-12 19:43:46,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 30 states have internal predecessors, (58), 9 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (21), 16 states have call predecessors, (21), 9 states have call successors, (21) [2024-10-12 19:43:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2024-10-12 19:43:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:43:46,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:43:46,432 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:43:46,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:43:46,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:46,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:43:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:43:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash -828786649, now seen corresponding path program 4 times [2024-10-12 19:43:46,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:43:46,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733484667] [2024-10-12 19:43:46,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:43:46,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:43:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:46,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:43:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:43:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-10-12 19:43:48,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:43:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733484667] [2024-10-12 19:43:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733484667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:43:48,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345144141] [2024-10-12 19:43:48,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-12 19:43:48,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:43:48,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:43:48,044 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:43:48,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-12 19:43:48,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-12 19:43:48,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:43:48,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-12 19:43:48,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:43:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-10-12 19:43:49,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:44:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-10-12 19:44:06,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345144141] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:44:06,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:44:06,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 42] total 76 [2024-10-12 19:44:06,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123372363] [2024-10-12 19:44:06,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:44:06,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-10-12 19:44:06,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:44:06,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-10-12 19:44:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=5134, Unknown=0, NotChecked=0, Total=5700 [2024-10-12 19:44:06,395 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-10-12 19:44:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:44:07,817 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-10-12 19:44:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-12 19:44:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) Word has length 82 [2024-10-12 19:44:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:44:07,819 INFO L225 Difference]: With dead ends: 90 [2024-10-12 19:44:07,819 INFO L226 Difference]: Without dead ends: 84 [2024-10-12 19:44:07,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2953 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1873, Invalid=12889, Unknown=0, NotChecked=0, Total=14762 [2024-10-12 19:44:07,822 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:44:07,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 590 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:44:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-12 19:44:07,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-12 19:44:07,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 57 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 25 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-12 19:44:07,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2024-10-12 19:44:07,831 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2024-10-12 19:44:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:44:07,832 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2024-10-12 19:44:07,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.236842105263158) internal successors, (94), 48 states have internal predecessors, (94), 15 states have call successors, (15), 1 states have call predecessors, (15), 27 states have return successors, (39), 28 states have call predecessors, (39), 15 states have call successors, (39) [2024-10-12 19:44:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2024-10-12 19:44:07,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-12 19:44:07,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:44:07,834 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:44:07,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:44:08,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:44:08,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:44:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:44:08,037 INFO L85 PathProgramCache]: Analyzing trace with hash 479378343, now seen corresponding path program 5 times [2024-10-12 19:44:08,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:44:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31312948] [2024-10-12 19:44:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:44:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:44:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:09,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:10,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:11,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:11,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:11,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:13,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:44:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:44:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2024-10-12 19:44:13,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:44:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31312948] [2024-10-12 19:44:13,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31312948] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:44:13,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71002376] [2024-10-12 19:44:13,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-12 19:44:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:44:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:44:13,297 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:44:13,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-12 19:44:13,545 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2024-10-12 19:44:13,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:44:13,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-12 19:44:13,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:44:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 876 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2024-10-12 19:44:15,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:44:15,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71002376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:44:15,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:44:15,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [55] total 107 [2024-10-12 19:44:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956248162] [2024-10-12 19:44:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:44:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-10-12 19:44:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:44:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-10-12 19:44:15,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-10-12 19:44:15,756 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-12 19:44:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:44:15,869 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2024-10-12 19:44:15,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-12 19:44:15,870 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) Word has length 154 [2024-10-12 19:44:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:44:15,871 INFO L225 Difference]: With dead ends: 84 [2024-10-12 19:44:15,871 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:44:15,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=793, Invalid=10549, Unknown=0, NotChecked=0, Total=11342 [2024-10-12 19:44:15,874 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:44:15,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:44:15,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:44:15,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:44:15,875 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-12 19:44:15,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:44:15,875 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2024-10-12 19:44:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:44:15,875 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:44:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.0754716981132075) internal successors, (57), 29 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (25), 25 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-12 19:44:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:44:15,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:44:15,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:44:15,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 19:44:16,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:44:16,081 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1] [2024-10-12 19:44:16,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:44:16,382 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 19:44:16,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 07:44:16 BoogieIcfgContainer [2024-10-12 19:44:16,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 19:44:16,405 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 19:44:16,405 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 19:44:16,405 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 19:44:16,406 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:43:38" (3/4) ... [2024-10-12 19:44:16,407 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-12 19:44:16,409 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hanoi [2024-10-12 19:44:16,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-12 19:44:16,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-12 19:44:16,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-12 19:44:16,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-12 19:44:16,470 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 19:44:16,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-12 19:44:16,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 19:44:16,471 INFO L158 Benchmark]: Toolchain (without parser) took 38593.33ms. Allocated memory was 167.8MB in the beginning and 683.7MB in the end (delta: 515.9MB). Free memory was 102.6MB in the beginning and 305.5MB in the end (delta: -202.9MB). Peak memory consumption was 314.0MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 104.9MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.31ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 138.3MB in the end (delta: -35.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.02ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 135.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: RCFGBuilder took 242.86ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 124.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,472 INFO L158 Benchmark]: TraceAbstraction took 38016.77ms. Allocated memory was 167.8MB in the beginning and 683.7MB in the end (delta: 515.9MB). Free memory was 123.7MB in the beginning and 309.7MB in the end (delta: -186.1MB). Peak memory consumption was 328.4MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,473 INFO L158 Benchmark]: Witness Printer took 65.85ms. Allocated memory is still 683.7MB. Free memory was 309.7MB in the beginning and 305.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 19:44:16,474 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.12ms. Allocated memory is still 104.9MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.31ms. Allocated memory is still 167.8MB. Free memory was 102.4MB in the beginning and 138.3MB in the end (delta: -35.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.02ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 167.8MB. Free memory was 136.9MB in the beginning and 135.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 242.86ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 124.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38016.77ms. Allocated memory was 167.8MB in the beginning and 683.7MB in the end (delta: 515.9MB). Free memory was 123.7MB in the beginning and 309.7MB in the end (delta: -186.1MB). Peak memory consumption was 328.4MB. Max. memory is 16.1GB. * Witness Printer took 65.85ms. Allocated memory is still 683.7MB. Free memory was 309.7MB in the beginning and 305.5MB in the end (delta: 4.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: 35]: 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, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 37.6s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 1333 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1216 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2271 IncrementalHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 117 mSDtfsCounter, 2271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5023 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=5, InterpolantAutomatonStates: 174, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 662 NumberOfCodeBlocks, 662 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 3457 SizeOfPredicates, 22 NumberOfNonLiveVariables, 864 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 15 InterpolantComputations, 2 PerfectInterpolantSequences, 3280/5280 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 - ProcedureContractResult [Line: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi. Ensures: ((((((((((((((((n <= 13) && (8191 <= \result)) || ((3 <= \result) && (n <= 2))) || ((n <= 11) && (2047 <= \result))) || ((n <= 6) && (63 <= \result))) || ((511 <= \result) && (n <= 9))) || ((n <= 7) && (127 <= \result))) || (33554430 < \result)) || ((n <= 8) && (255 <= \result))) || ((n <= 12) && (4095 <= \result))) || ((\result == 1) && (n == 1))) || ((n <= 5) && (31 <= \result))) || ((1023 <= \result) && (n <= 10))) || ((7 <= \result) && (n <= 3))) || ((16383 <= \result) && (((long long) 8178 + n) <= \result))) || ((15 <= \result) && (n <= 4))) RESULT: Ultimate proved your program to be correct! [2024-10-12 19:44:16,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE