./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci01-1.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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:32:21,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:32:21,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:32:21,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:32:21,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:32:21,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:32:21,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:32:21,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:32:21,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:32:21,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:32:21,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:32:21,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:32:21,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:32:21,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:32:21,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:32:21,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:32:21,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:32:21,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:21,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:32:21,677 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2025-03-03 14:32:21,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:32:21,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:32:21,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:32:21,877 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:32:21,877 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:32:21,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-03-03 14:32:22,995 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049122d90/cd7f58637cae4f57a76c2f83b96be028/FLAG20ef965df [2025-03-03 14:32:23,204 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:32:23,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-03-03 14:32:23,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049122d90/cd7f58637cae4f57a76c2f83b96be028/FLAG20ef965df [2025-03-03 14:32:23,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049122d90/cd7f58637cae4f57a76c2f83b96be028 [2025-03-03 14:32:23,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:32:23,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:32:23,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:23,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:32:23,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:32:23,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3993ea07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23, skipping insertion in model container [2025-03-03 14:32:23,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:32:23,348 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2025-03-03 14:32:23,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:23,360 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:32:23,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c[804,817] [2025-03-03 14:32:23,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:23,380 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:32:23,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23 WrapperNode [2025-03-03 14:32:23,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:23,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:23,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:32:23,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:32:23,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,402 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-03 14:32:23,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:23,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:32:23,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:32:23,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:32:23,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,415 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]. [2025-03-03 14:32:23,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,418 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:32:23,421 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:32:23,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:32:23,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:32:23,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (1/1) ... [2025-03-03 14:32:23,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:23,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:23,447 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) [2025-03-03 14:32:23,448 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 [2025-03-03 14:32:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-03 14:32:23,465 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-03 14:32:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:32:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:32:23,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:32:23,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:32:23,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:32:23,500 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:32:23,551 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-03 14:32:23,580 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-03 14:32:23,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:32:23,586 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:32:23,586 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:32:23,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:23 BoogieIcfgContainer [2025-03-03 14:32:23,586 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:32:23,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:32:23,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:32:23,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:32:23,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:32:23" (1/3) ... [2025-03-03 14:32:23,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6f4cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:23, skipping insertion in model container [2025-03-03 14:32:23,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:23" (2/3) ... [2025-03-03 14:32:23,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6f4cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:23, skipping insertion in model container [2025-03-03 14:32:23,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:23" (3/3) ... [2025-03-03 14:32:23,593 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2025-03-03 14:32:23,604 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:32:23,605 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:32:23,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:32:23,658 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;@74b2db1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:32:23,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:32:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 14:32:23,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:32:23,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:23,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:23,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:23,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 828343037, now seen corresponding path program 1 times [2025-03-03 14:32:23,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:23,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533031369] [2025-03-03 14:32:23,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:23,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:23,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:32:23,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:32:23,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:23,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:32:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:23,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533031369] [2025-03-03 14:32:23,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533031369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:23,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:32:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26629510] [2025-03-03 14:32:23,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:23,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:32:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:23,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:32:23,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:32:23,975 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-03 14:32:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:24,079 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-03 14:32:24,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:32:24,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-03 14:32:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:24,085 INFO L225 Difference]: With dead ends: 31 [2025-03-03 14:32:24,085 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:32:24,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:32:24,089 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:24,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 55 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:32:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-03 14:32:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:32:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 14:32:24,115 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2025-03-03 14:32:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 14:32:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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) [2025-03-03 14:32:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 14:32:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 14:32:24,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:24,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:24,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:32:24,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:24,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1856819262, now seen corresponding path program 1 times [2025-03-03 14:32:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772208690] [2025-03-03 14:32:24,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:24,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 14:32:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 14:32:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:24,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:32:24,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772208690] [2025-03-03 14:32:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772208690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:32:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531609505] [2025-03-03 14:32:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:32:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:24,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:32:24,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:32:24,228 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-03 14:32:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:24,301 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-03-03 14:32:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:32:24,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-03 14:32:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:24,302 INFO L225 Difference]: With dead ends: 25 [2025-03-03 14:32:24,302 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:32:24,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:32:24,303 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:32:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-03 14:32:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 14:32:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 14:32:24,308 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-03-03 14:32:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:24,308 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 14:32:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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) [2025-03-03 14:32:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 14:32:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 14:32:24,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:24,310 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:32:24,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:24,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash 87542200, now seen corresponding path program 1 times [2025-03-03 14:32:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343257913] [2025-03-03 14:32:24,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:24,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:24,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:24,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:32:24,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343257913] [2025-03-03 14:32:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343257913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891212267] [2025-03-03 14:32:24,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:24,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:24,396 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) [2025-03-03 14:32:24,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:32:24,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 14:32:24,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 14:32:24,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:24,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:24,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:32:24,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:32:24,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:32:24,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891212267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:24,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-03 14:32:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732334162] [2025-03-03 14:32:24,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:24,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 14:32:24,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:24,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 14:32:24,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-03 14:32:24,945 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 14:32:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:25,087 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-03-03 14:32:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:32:25,088 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 24 [2025-03-03 14:32:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:25,088 INFO L225 Difference]: With dead ends: 36 [2025-03-03 14:32:25,088 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:32:25,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:32:25,089 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:25,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 134 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:32:25,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 14:32:25,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:32:25,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-03 14:32:25,096 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 24 [2025-03-03 14:32:25,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:25,096 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-03 14:32:25,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-03 14:32:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-03 14:32:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 14:32:25,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:25,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:25,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:25,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:25,297 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:25,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash -944726963, now seen corresponding path program 1 times [2025-03-03 14:32:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:25,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968120285] [2025-03-03 14:32:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:32:25,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:32:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:25,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:32:25,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968120285] [2025-03-03 14:32:25,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968120285] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:25,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532059364] [2025-03-03 14:32:25,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:25,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:25,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:25,461 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) [2025-03-03 14:32:25,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:32:25,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 14:32:25,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 14:32:25,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:25,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:25,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:32:25,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:32:25,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:32:25,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532059364] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:25,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:25,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-03-03 14:32:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553899040] [2025-03-03 14:32:25,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 14:32:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:25,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 14:32:25,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:32:25,919 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 14:32:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:26,074 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2025-03-03 14:32:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:32:26,074 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 25 [2025-03-03 14:32:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:26,076 INFO L225 Difference]: With dead ends: 32 [2025-03-03 14:32:26,076 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 14:32:26,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:32:26,077 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:26,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 14:32:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 14:32:26,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:32:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-03 14:32:26,085 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 25 [2025-03-03 14:32:26,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:26,086 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-03 14:32:26,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 14:32:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-03-03 14:32:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 14:32:26,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:26,087 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:26,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:32:26,287 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,SelfDestructingSolverStorable3 [2025-03-03 14:32:26,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:26,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:26,288 INFO L85 PathProgramCache]: Analyzing trace with hash 16031016, now seen corresponding path program 2 times [2025-03-03 14:32:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:26,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614979428] [2025-03-03 14:32:26,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:26,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 14:32:26,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:32:26,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:26,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:32:26,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614979428] [2025-03-03 14:32:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614979428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266753494] [2025-03-03 14:32:26,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:26,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:26,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:26,406 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) [2025-03-03 14:32:26,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:32:26,428 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-03 14:32:26,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 14:32:26,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:26,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:26,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:32:26,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:32:26,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:32:26,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266753494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:26,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:26,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2025-03-03 14:32:26,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785986758] [2025-03-03 14:32:26,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:26,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:32:26,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:26,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:32:26,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:32:26,706 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 14:32:26,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:26,784 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-03-03 14:32:26,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:32:26,785 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 38 [2025-03-03 14:32:26,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:26,786 INFO L225 Difference]: With dead ends: 53 [2025-03-03 14:32:26,786 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 14:32:26,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:32:26,787 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:26,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 89 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 14:32:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-03-03 14:32:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:32:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-03 14:32:26,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 38 [2025-03-03 14:32:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-03 14:32:26,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-03 14:32:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-03 14:32:26,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 14:32:26,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:26,795 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:26,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:26,999 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1088857853, now seen corresponding path program 3 times [2025-03-03 14:32:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133171739] [2025-03-03 14:32:27,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:27,004 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-03 14:32:27,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-03-03 14:32:27,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:32:27,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:32:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133171739] [2025-03-03 14:32:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133171739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708014577] [2025-03-03 14:32:27,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:27,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:27,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:27,183 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) [2025-03-03 14:32:27,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:32:27,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 5 equivalence classes. [2025-03-03 14:32:27,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 39 statements. [2025-03-03 14:32:27,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 14:32:27,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:27,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:32:27,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:32:27,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:27,824 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:32:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708014577] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:27,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-03 14:32:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552776625] [2025-03-03 14:32:27,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:27,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 14:32:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:27,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 14:32:27,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-03-03 14:32:27,826 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-03 14:32:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:28,069 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2025-03-03 14:32:28,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:32:28,069 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Word has length 39 [2025-03-03 14:32:28,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:28,070 INFO L225 Difference]: With dead ends: 45 [2025-03-03 14:32:28,070 INFO L226 Difference]: Without dead ends: 41 [2025-03-03 14:32:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=1313, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:32:28,072 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 156 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-03 14:32:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2025-03-03 14:32:28,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:32:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2025-03-03 14:32:28,081 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 39 [2025-03-03 14:32:28,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:28,081 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2025-03-03 14:32:28,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 21 states have internal predecessors, (47), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-03 14:32:28,081 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2025-03-03 14:32:28,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:32:28,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:28,082 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:28,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:28,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:28,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:28,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1921640697, now seen corresponding path program 4 times [2025-03-03 14:32:28,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:28,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303412247] [2025-03-03 14:32:28,283 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:28,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:28,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:32:28,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-03-03 14:32:28,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:28,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:32:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303412247] [2025-03-03 14:32:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303412247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692046361] [2025-03-03 14:32:28,331 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:28,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:28,333 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) [2025-03-03 14:32:28,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:32:28,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:32:28,371 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 53 statements. [2025-03-03 14:32:28,371 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 14:32:28,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:32:28,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:28,391 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:32:28,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-03 14:32:28,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692046361] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:28,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-03 14:32:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64754893] [2025-03-03 14:32:28,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:32:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:28,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:32:28,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:32:28,511 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:32:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:28,591 INFO L93 Difference]: Finished difference Result 61 states and 89 transitions. [2025-03-03 14:32:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:32:28,592 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 53 [2025-03-03 14:32:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:28,592 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:32:28,592 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 14:32:28,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:32:28,593 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:28,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:32:28,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 14:32:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-03 14:32:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-03 14:32:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-03-03 14:32:28,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 53 [2025-03-03 14:32:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:28,599 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-03-03 14:32:28,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:32:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-03-03 14:32:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:32:28,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:28,600 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:28,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:28,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1457957336, now seen corresponding path program 5 times [2025-03-03 14:32:28,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:28,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011540553] [2025-03-03 14:32:28,807 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:28,811 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 6 equivalence classes. [2025-03-03 14:32:28,814 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 52 statements. [2025-03-03 14:32:28,814 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 14:32:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:32:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011540553] [2025-03-03 14:32:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011540553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963340914] [2025-03-03 14:32:28,890 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:28,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:32:28,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:32:28,917 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 6 equivalence classes. [2025-03-03 14:32:28,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 52 statements. [2025-03-03 14:32:28,924 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 14:32:28,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:32:28,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:28,983 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:32:28,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:29,214 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:32:29,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963340914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:29,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:29,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2025-03-03 14:32:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669971739] [2025-03-03 14:32:29,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:29,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 14:32:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:29,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 14:32:29,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:32:29,215 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-03 14:32:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:29,328 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2025-03-03 14:32:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:32:29,329 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 52 [2025-03-03 14:32:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:29,329 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:32:29,330 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 14:32:29,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:32:29,330 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:29,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 62 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 14:32:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 14:32:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-03 14:32:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2025-03-03 14:32:29,337 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 52 [2025-03-03 14:32:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2025-03-03 14:32:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.75) internal successors, (44), 17 states have internal predecessors, (44), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-03 14:32:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2025-03-03 14:32:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:32:29,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:29,339 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:29,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:29,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:29,540 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:29,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1228403338, now seen corresponding path program 6 times [2025-03-03 14:32:29,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:29,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662715561] [2025-03-03 14:32:29,540 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:29,544 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 94 statements into 12 equivalence classes. [2025-03-03 14:32:29,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 86 of 94 statements. [2025-03-03 14:32:29,561 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-03 14:32:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 61 proven. 178 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-03-03 14:32:30,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:30,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662715561] [2025-03-03 14:32:30,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662715561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:30,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898137663] [2025-03-03 14:32:30,011 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:30,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:30,014 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:32:30,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:32:30,043 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 94 statements into 12 equivalence classes. [2025-03-03 14:32:30,067 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 86 of 94 statements. [2025-03-03 14:32:30,067 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-03 14:32:30,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 14:32:30,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 146 proven. 67 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-03 14:32:30,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 110 proven. 112 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-03 14:32:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898137663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:32,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 20] total 42 [2025-03-03 14:32:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821555835] [2025-03-03 14:32:32,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:32,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 14:32:32,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:32,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 14:32:32,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:32:32,036 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 27 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-03 14:32:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:32,450 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2025-03-03 14:32:32,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:32:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 27 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) Word has length 94 [2025-03-03 14:32:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:32,451 INFO L225 Difference]: With dead ends: 52 [2025-03-03 14:32:32,451 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:32:32,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 164 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=422, Invalid=2770, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 14:32:32,454 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:32,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:32:32,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:32:32,454 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) [2025-03-03 14:32:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:32:32,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 94 [2025-03-03 14:32:32,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:32,455 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:32:32,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.4761904761904763) internal successors, (62), 27 states have internal predecessors, (62), 10 states have call successors, (11), 1 states have call predecessors, (11), 11 states have return successors, (21), 21 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-03 14:32:32,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:32:32,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:32:32,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:32:32,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 14:32:32,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:32,665 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2025-03-03 14:32:32,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:32:32,944 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:32:32,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:32:32 BoogieIcfgContainer [2025-03-03 14:32:32,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:32:32,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:32:32,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:32:32,948 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:32:32,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:23" (3/4) ... [2025-03-03 14:32:32,950 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:32:32,953 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-03-03 14:32:32,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 14:32:32,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 14:32:32,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:32:32,955 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:32:32,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:32:32,997 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:32:32,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:32:32,998 INFO L158 Benchmark]: Toolchain (without parser) took 9769.16ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 133.3MB in the beginning and 153.4MB in the end (delta: -20.1MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2025-03-03 14:32:33,001 INFO L158 Benchmark]: CDTParser took 0.73ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.41ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 122.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.79ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.5MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: Boogie Preprocessor took 16.68ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 973.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: IcfgBuilder took 165.17ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 110.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: TraceAbstraction took 9359.61ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 109.8MB in the beginning and 158.3MB in the end (delta: -48.5MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2025-03-03 14:32:33,002 INFO L158 Benchmark]: Witness Printer took 49.27ms. Allocated memory is still 209.7MB. Free memory was 158.3MB in the beginning and 153.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:32:33,003 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.73ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.41ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 122.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.79ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 121.5MB in the end (delta: 898.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.68ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 973.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 165.17ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 110.2MB in the end (delta: 10.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9359.61ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 109.8MB in the beginning and 158.3MB in the end (delta: -48.5MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. * Witness Printer took 49.27ms. Allocated memory is still 209.7MB. Free memory was 158.3MB in the beginning and 153.4MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. 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: 36]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 9, TraceHistogramMax: 13, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 182 mSDsluCounter, 889 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1538 IncrementalHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 133 mSDtfsCounter, 1538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 796 GetRequests, 564 SyntacticMatches, 35 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=8, InterpolantAutomatonStates: 101, 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, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 673 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 975 ConstructedInterpolants, 0 QuantifiedInterpolants, 2628 SizeOfPredicates, 10 NumberOfNonLiveVariables, 710 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 1601/2298 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-03 14:32:33,014 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