./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/in-de52.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/loops-crafted-1/in-de52.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 9b751a069fbdcae3e94881bf50bfce280447c39410a7e3e609a38e97e353596d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:46:57,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:46:57,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:46:57,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:46:57,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:46:57,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:46:57,546 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:46:57,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:46:57,547 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:46:57,547 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:46:57,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:46:57,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:46:57,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:46:57,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:46:57,547 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:46:57,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:46:57,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:46:57,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:46:57,549 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:46:57,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:46:57,549 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 -> 9b751a069fbdcae3e94881bf50bfce280447c39410a7e3e609a38e97e353596d [2025-03-08 04:46:57,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:46:57,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:46:57,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:46:57,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:46:57,753 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:46:57,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/in-de52.c [2025-03-08 04:46:58,845 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0cacf6c/c453d62c5c764bf39e9092806b7d158e/FLAG35ec51559 [2025-03-08 04:46:59,062 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:46:59,063 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/in-de52.c [2025-03-08 04:46:59,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0cacf6c/c453d62c5c764bf39e9092806b7d158e/FLAG35ec51559 [2025-03-08 04:46:59,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0cacf6c/c453d62c5c764bf39e9092806b7d158e [2025-03-08 04:46:59,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:46:59,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:46:59,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:46:59,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:46:59,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:46:59,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568aa3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59, skipping insertion in model container [2025-03-08 04:46:59,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:46:59,513 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/loops-crafted-1/in-de52.c[368,381] [2025-03-08 04:46:59,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:46:59,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:46:59,538 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/loops-crafted-1/in-de52.c[368,381] [2025-03-08 04:46:59,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:46:59,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:46:59,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59 WrapperNode [2025-03-08 04:46:59,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:46:59,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:46:59,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:46:59,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:46:59,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,574 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-08 04:46:59,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:46:59,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:46:59,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:46:59,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:46:59,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,590 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-08 04:46:59,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:46:59,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:46:59,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:46:59,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:46:59,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (1/1) ... [2025-03-08 04:46:59,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:46:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:46:59,624 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-08 04:46:59,626 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-08 04:46:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:46:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:46:59,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:46:59,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:46:59,679 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:46:59,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:46:59,776 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 04:46:59,776 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:46:59,781 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:46:59,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:46:59,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:59 BoogieIcfgContainer [2025-03-08 04:46:59,782 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:46:59,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:46:59,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:46:59,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:46:59,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:46:59" (1/3) ... [2025-03-08 04:46:59,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e031c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:59, skipping insertion in model container [2025-03-08 04:46:59,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:46:59" (2/3) ... [2025-03-08 04:46:59,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669e031c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:46:59, skipping insertion in model container [2025-03-08 04:46:59,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:46:59" (3/3) ... [2025-03-08 04:46:59,787 INFO L128 eAbstractionObserver]: Analyzing ICFG in-de52.c [2025-03-08 04:46:59,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:46:59,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG in-de52.c that has 1 procedures, 14 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 04:46:59,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:46:59,845 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;@2bf4e117, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:46:59,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:46:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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-08 04:46:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 04:46:59,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:46:59,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:46:59,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:46:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:46:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1410626646, now seen corresponding path program 1 times [2025-03-08 04:46:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:46:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112020467] [2025-03-08 04:46:59,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:46:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:46:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 04:46:59,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 04:46:59,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:46:59,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,065 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-08 04:47:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112020467] [2025-03-08 04:47:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112020467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:47:00,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:47:00,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:47:00,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245869449] [2025-03-08 04:47:00,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:00,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:47:00,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:00,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:47:00,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:47:00,084 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 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) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-08 04:47:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:00,126 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2025-03-08 04:47:00,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:47:00,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) Word has length 9 [2025-03-08 04:47:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:00,131 INFO L225 Difference]: With dead ends: 30 [2025-03-08 04:47:00,131 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 04:47:00,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:47:00,135 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:00,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 04:47:00,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 04:47:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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-08 04:47:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2025-03-08 04:47:00,160 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2025-03-08 04:47:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:00,161 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 22 transitions. [2025-03-08 04:47:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-08 04:47:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2025-03-08 04:47:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:47:00,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:00,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:00,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:47:00,163 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:00,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:00,164 INFO L85 PathProgramCache]: Analyzing trace with hash -780585256, now seen corresponding path program 1 times [2025-03-08 04:47:00,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:00,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3960924] [2025-03-08 04:47:00,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:00,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:47:00,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:47:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:47:00,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3960924] [2025-03-08 04:47:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3960924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:47:00,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:47:00,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:47:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740770825] [2025-03-08 04:47:00,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:00,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:47:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:00,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:47:00,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:47:00,204 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 04:47:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:00,222 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2025-03-08 04:47:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:47:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-08 04:47:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:00,223 INFO L225 Difference]: With dead ends: 25 [2025-03-08 04:47:00,223 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 04:47:00,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:47:00,224 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:00,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:00,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 04:47:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 04:47:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 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-08 04:47:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2025-03-08 04:47:00,228 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 10 [2025-03-08 04:47:00,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:00,228 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2025-03-08 04:47:00,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 04:47:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2025-03-08 04:47:00,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 04:47:00,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:00,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:00,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:47:00,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:00,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -779721317, now seen corresponding path program 1 times [2025-03-08 04:47:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397923479] [2025-03-08 04:47:00,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:00,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 04:47:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 04:47:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:47:00,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397923479] [2025-03-08 04:47:00,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397923479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:47:00,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:47:00,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:47:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285568822] [2025-03-08 04:47:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:00,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:47:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:00,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:47:00,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:47:00,269 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 04:47:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:00,289 INFO L93 Difference]: Finished difference Result 31 states and 46 transitions. [2025-03-08 04:47:00,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:47:00,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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) Word has length 10 [2025-03-08 04:47:00,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:00,290 INFO L225 Difference]: With dead ends: 31 [2025-03-08 04:47:00,290 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 04:47:00,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:47:00,291 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:00,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 04:47:00,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 04:47:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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-08 04:47:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-03-08 04:47:00,298 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 10 [2025-03-08 04:47:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:00,298 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-08 04:47:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-08 04:47:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2025-03-08 04:47:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:47:00,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:00,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:00,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:47:00,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:00,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:00,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1688913130, now seen corresponding path program 1 times [2025-03-08 04:47:00,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:00,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846410606] [2025-03-08 04:47:00,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:00,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:47:00,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:47:00,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:00,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846410606] [2025-03-08 04:47:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846410606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:47:00,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:47:00,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:47:00,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58216042] [2025-03-08 04:47:00,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:47:00,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:00,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:47:00,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:47:00,382 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 04:47:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:00,417 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-03-08 04:47:00,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:47:00,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) Word has length 11 [2025-03-08 04:47:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:00,418 INFO L225 Difference]: With dead ends: 30 [2025-03-08 04:47:00,418 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:47:00,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:47:00,420 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:00,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:47:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-08 04:47:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 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-08 04:47:00,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2025-03-08 04:47:00,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 11 [2025-03-08 04:47:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:00,427 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2025-03-08 04:47:00,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-08 04:47:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2025-03-08 04:47:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:47:00,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:00,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:00,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:47:00,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:00,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1417496633, now seen corresponding path program 1 times [2025-03-08 04:47:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555555147] [2025-03-08 04:47:00,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:00,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:47:00,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:47:00,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:00,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555555147] [2025-03-08 04:47:00,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555555147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923134530] [2025-03-08 04:47:00,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:00,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:00,513 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-08 04:47:00,514 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-08 04:47:00,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:47:00,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:47:00,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 04:47:00,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:00,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923134530] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:47:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2025-03-08 04:47:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109813979] [2025-03-08 04:47:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:00,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:47:00,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:00,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:47:00,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:00,634 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 04:47:00,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:00,653 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-03-08 04:47:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:47:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2025-03-08 04:47:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:00,654 INFO L225 Difference]: With dead ends: 24 [2025-03-08 04:47:00,654 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:47:00,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:00,655 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:00,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:47:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 04:47:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 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-08 04:47:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2025-03-08 04:47:00,657 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 12 [2025-03-08 04:47:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:00,658 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2025-03-08 04:47:00,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 04:47:00,658 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2025-03-08 04:47:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 04:47:00,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:00,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:00,664 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-08 04:47:00,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:00,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:00,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 498659864, now seen corresponding path program 1 times [2025-03-08 04:47:00,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:00,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216859148] [2025-03-08 04:47:00,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:00,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:47:00,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:47:00,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:00,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216859148] [2025-03-08 04:47:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216859148] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:00,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291791483] [2025-03-08 04:47:00,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:00,934 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-08 04:47:00,936 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-08 04:47:00,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 04:47:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 04:47:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:00,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 04:47:00,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:00,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:01,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291791483] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:01,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:47:01,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 8 [2025-03-08 04:47:01,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268148602] [2025-03-08 04:47:01,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:47:01,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:47:01,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:01,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:47:01,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:01,015 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 04:47:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:01,036 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2025-03-08 04:47:01,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:47:01,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2025-03-08 04:47:01,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:01,037 INFO L225 Difference]: With dead ends: 23 [2025-03-08 04:47:01,037 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 04:47:01,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:01,038 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:01,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 04:47:01,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 04:47:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-08 04:47:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2025-03-08 04:47:01,042 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 20 transitions. Word has length 12 [2025-03-08 04:47:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:01,043 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 20 transitions. [2025-03-08 04:47:01,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-08 04:47:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2025-03-08 04:47:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:47:01,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:01,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:01,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:01,244 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,SelfDestructingSolverStorable5 [2025-03-08 04:47:01,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 190274245, now seen corresponding path program 1 times [2025-03-08 04:47:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198827442] [2025-03-08 04:47:01,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:01,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:47:01,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:47:01,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:01,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198827442] [2025-03-08 04:47:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198827442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359196560] [2025-03-08 04:47:01,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:01,327 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-08 04:47:01,328 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-08 04:47:01,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:47:01,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:47:01,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:01,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:01,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 04:47:01,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:01,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:01,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:01,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:01,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359196560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:01,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:01,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-03-08 04:47:01,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560030398] [2025-03-08 04:47:01,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:01,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:47:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:01,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:47:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:47:01,446 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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-08 04:47:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:01,724 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2025-03-08 04:47:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 04:47:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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) Word has length 13 [2025-03-08 04:47:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:01,725 INFO L225 Difference]: With dead ends: 63 [2025-03-08 04:47:01,725 INFO L226 Difference]: Without dead ends: 53 [2025-03-08 04:47:01,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-03-08 04:47:01,726 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 29 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:01,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 41 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:47:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-08 04:47:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 25. [2025-03-08 04:47:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 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-08 04:47:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-08 04:47:01,738 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 13 [2025-03-08 04:47:01,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:01,738 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-08 04:47:01,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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-08 04:47:01,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-08 04:47:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:47:01,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:01,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:01,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:47:01,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:01,941 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:01,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:01,941 INFO L85 PathProgramCache]: Analyzing trace with hash 191138184, now seen corresponding path program 1 times [2025-03-08 04:47:01,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:01,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925422592] [2025-03-08 04:47:01,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:01,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:01,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:47:01,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:47:01,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:01,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:01,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925422592] [2025-03-08 04:47:01,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925422592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:01,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080975091] [2025-03-08 04:47:01,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:01,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:01,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:01,996 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-08 04:47:01,997 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-08 04:47:02,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:47:02,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:47:02,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:02,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:02,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 04:47:02,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:47:02,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:47:02,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080975091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:02,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:02,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 04:47:02,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383808087] [2025-03-08 04:47:02,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:02,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:47:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:02,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:47:02,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:47:02,071 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-08 04:47:02,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:02,119 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2025-03-08 04:47:02,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:47:02,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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) Word has length 13 [2025-03-08 04:47:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:02,120 INFO L225 Difference]: With dead ends: 57 [2025-03-08 04:47:02,120 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 04:47:02,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:47:02,120 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:02,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 04:47:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2025-03-08 04:47:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 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-08 04:47:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2025-03-08 04:47:02,135 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 13 [2025-03-08 04:47:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:02,136 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2025-03-08 04:47:02,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-08 04:47:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2025-03-08 04:47:02,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 04:47:02,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:02,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:02,142 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-08 04:47:02,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:02,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:02,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:02,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1603566048, now seen corresponding path program 1 times [2025-03-08 04:47:02,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:02,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279564712] [2025-03-08 04:47:02,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:02,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:02,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:47:02,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:47:02,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:02,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:02,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279564712] [2025-03-08 04:47:02,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279564712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:02,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490489733] [2025-03-08 04:47:02,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:47:02,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:02,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:02,437 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-08 04:47:02,439 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-08 04:47:02,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 04:47:02,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 04:47:02,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:02,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:02,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 04:47:02,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:02,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:02,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490489733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:02,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:02,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2025-03-08 04:47:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247539854] [2025-03-08 04:47:02,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:02,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:47:02,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:02,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:47:02,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:02,534 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 04:47:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:02,594 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2025-03-08 04:47:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:47:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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) Word has length 14 [2025-03-08 04:47:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:02,595 INFO L225 Difference]: With dead ends: 51 [2025-03-08 04:47:02,595 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:47:02,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:02,595 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:02,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:02,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:47:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-08 04:47:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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-08 04:47:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2025-03-08 04:47:02,606 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 14 [2025-03-08 04:47:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:02,606 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2025-03-08 04:47:02,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-08 04:47:02,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2025-03-08 04:47:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:47:02,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:02,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:02,614 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-08 04:47:02,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:02,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:02,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1839325174, now seen corresponding path program 2 times [2025-03-08 04:47:02,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:02,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907752447] [2025-03-08 04:47:02,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:02,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:02,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 04:47:02,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:47:02,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:02,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:02,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907752447] [2025-03-08 04:47:02,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907752447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:02,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724920184] [2025-03-08 04:47:02,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:02,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:02,899 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-08 04:47:02,900 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-08 04:47:02,925 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-08 04:47:02,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:47:02,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:02,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:02,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 04:47:02,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:02,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724920184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:03,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:03,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 12 [2025-03-08 04:47:03,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033061362] [2025-03-08 04:47:03,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:03,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:47:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:03,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:47:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:47:03,011 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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-08 04:47:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:03,147 INFO L93 Difference]: Finished difference Result 83 states and 128 transitions. [2025-03-08 04:47:03,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:47:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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) Word has length 15 [2025-03-08 04:47:03,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:03,148 INFO L225 Difference]: With dead ends: 83 [2025-03-08 04:47:03,148 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:47:03,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:47:03,149 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:03,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:47:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:47:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2025-03-08 04:47:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.434782608695652) internal successors, (66), 46 states have internal predecessors, (66), 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-08 04:47:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 66 transitions. [2025-03-08 04:47:03,173 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 66 transitions. Word has length 15 [2025-03-08 04:47:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:03,173 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-08 04:47:03,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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-08 04:47:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2025-03-08 04:47:03,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:47:03,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:03,176 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:03,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:47:03,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:03,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:03,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:03,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1377130744, now seen corresponding path program 3 times [2025-03-08 04:47:03,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:03,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296458683] [2025-03-08 04:47:03,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:03,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:03,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-08 04:47:03,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:47:03,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:47:03,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:03,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296458683] [2025-03-08 04:47:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296458683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947834098] [2025-03-08 04:47:03,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:03,492 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-08 04:47:03,493 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-08 04:47:03,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-08 04:47:03,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:47:03,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:47:03,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:03,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 04:47:03,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:03,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:03,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947834098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:03,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:03,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2025-03-08 04:47:03,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681449246] [2025-03-08 04:47:03,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:03,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:47:03,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:03,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:47:03,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:47:03,627 INFO L87 Difference]: Start difference. First operand 47 states and 66 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-08 04:47:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:03,886 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2025-03-08 04:47:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 04:47:03,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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) Word has length 16 [2025-03-08 04:47:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:03,887 INFO L225 Difference]: With dead ends: 72 [2025-03-08 04:47:03,888 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:47:03,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-08 04:47:03,889 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:03,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:47:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:47:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2025-03-08 04:47:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 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-08 04:47:03,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 68 transitions. [2025-03-08 04:47:03,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 68 transitions. Word has length 16 [2025-03-08 04:47:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:03,902 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 68 transitions. [2025-03-08 04:47:03,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 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-08 04:47:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 68 transitions. [2025-03-08 04:47:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 04:47:03,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:03,902 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:03,908 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-08 04:47:04,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:04,103 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:04,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:04,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1186744315, now seen corresponding path program 2 times [2025-03-08 04:47:04,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:04,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700098635] [2025-03-08 04:47:04,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:04,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 04:47:04,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:47:04,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:04,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:04,207 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:47:04,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700098635] [2025-03-08 04:47:04,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700098635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:04,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098393966] [2025-03-08 04:47:04,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:04,210 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:04,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 04:47:04,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 04:47:04,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 04:47:04,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:04,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:04,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 04:47:04,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:47:04,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:47:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098393966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:04,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 18 [2025-03-08 04:47:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73527528] [2025-03-08 04:47:04,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 04:47:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:04,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 04:47:04,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 04:47:04,432 INFO L87 Difference]: Start difference. First operand 49 states and 68 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-08 04:47:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:04,828 INFO L93 Difference]: Finished difference Result 119 states and 176 transitions. [2025-03-08 04:47:04,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 04:47:04,828 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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) Word has length 17 [2025-03-08 04:47:04,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:04,829 INFO L225 Difference]: With dead ends: 119 [2025-03-08 04:47:04,829 INFO L226 Difference]: Without dead ends: 88 [2025-03-08 04:47:04,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:47:04,829 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:04,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:47:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-08 04:47:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2025-03-08 04:47:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 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-08 04:47:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2025-03-08 04:47:04,844 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 17 [2025-03-08 04:47:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:04,844 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2025-03-08 04:47:04,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 states have internal predecessors, (38), 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-08 04:47:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2025-03-08 04:47:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:47:04,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:04,844 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:04,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 04:47:05,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 04:47:05,048 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 546951675, now seen corresponding path program 3 times [2025-03-08 04:47:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-03-08 04:47:05,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:05,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:47:05,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:47:05,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:47:05,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:05,144 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-08 04:47:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394414483] [2025-03-08 04:47:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394414483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291296739] [2025-03-08 04:47:05,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:05,146 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:05,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 04:47:05,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-08 04:47:05,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:47:05,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:47:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:05,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 04:47:05,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:05,192 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-08 04:47:05,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:47:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291296739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:05,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 5] total 14 [2025-03-08 04:47:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577103840] [2025-03-08 04:47:05,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:05,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:47:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:05,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:47:05,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:47:05,251 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-08 04:47:05,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:05,387 INFO L93 Difference]: Finished difference Result 110 states and 158 transitions. [2025-03-08 04:47:05,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:47:05,387 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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) Word has length 18 [2025-03-08 04:47:05,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:05,388 INFO L225 Difference]: With dead ends: 110 [2025-03-08 04:47:05,388 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 04:47:05,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:47:05,392 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 8 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:05,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 54 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:47:05,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 04:47:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2025-03-08 04:47:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 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-08 04:47:05,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-03-08 04:47:05,406 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 18 [2025-03-08 04:47:05,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:05,406 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-03-08 04:47:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-08 04:47:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-03-08 04:47:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:47:05,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:05,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:05,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:05,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 04:47:05,609 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:05,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1209070299, now seen corresponding path program 4 times [2025-03-08 04:47:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811309889] [2025-03-08 04:47:05,610 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:05,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-08 04:47:05,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:47:05,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:05,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:47:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811309889] [2025-03-08 04:47:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811309889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270671726] [2025-03-08 04:47:05,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:05,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:05,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:05,726 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:05,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 04:47:05,758 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-08 04:47:05,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:47:05,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:05,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:05,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:47:05,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:47:05,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:05,907 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:47:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270671726] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:05,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2025-03-08 04:47:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713617656] [2025-03-08 04:47:05,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:05,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 04:47:05,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:05,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 04:47:05,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2025-03-08 04:47:05,908 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 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-08 04:47:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:06,524 INFO L93 Difference]: Finished difference Result 120 states and 174 transitions. [2025-03-08 04:47:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 04:47:06,528 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 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) Word has length 19 [2025-03-08 04:47:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:06,528 INFO L225 Difference]: With dead ends: 120 [2025-03-08 04:47:06,528 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 04:47:06,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=2380, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 04:47:06,530 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:06,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 70 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:47:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 04:47:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 74. [2025-03-08 04:47:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 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-08 04:47:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2025-03-08 04:47:06,548 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 19 [2025-03-08 04:47:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:06,548 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2025-03-08 04:47:06,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 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-08 04:47:06,548 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2025-03-08 04:47:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:47:06,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:06,549 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:06,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 04:47:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 04:47:06,750 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash -490535415, now seen corresponding path program 2 times [2025-03-08 04:47:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290838080] [2025-03-08 04:47:06,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:06,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 04:47:06,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:47:06,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:47:06,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290838080] [2025-03-08 04:47:06,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290838080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:06,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695284744] [2025-03-08 04:47:06,888 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:06,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:06,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:06,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:06,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 04:47:06,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-08 04:47:06,920 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:47:06,920 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:06,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:06,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:47:06,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:06,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 04:47:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695284744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:07,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2025-03-08 04:47:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758661783] [2025-03-08 04:47:07,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:07,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 04:47:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:07,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 04:47:07,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-08 04:47:07,068 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-08 04:47:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:07,876 INFO L93 Difference]: Finished difference Result 206 states and 309 transitions. [2025-03-08 04:47:07,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 04:47:07,877 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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) Word has length 19 [2025-03-08 04:47:07,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:07,878 INFO L225 Difference]: With dead ends: 206 [2025-03-08 04:47:07,878 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 04:47:07,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=401, Invalid=2355, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 04:47:07,879 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 103 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:07,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 85 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:47:07,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 04:47:07,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 103. [2025-03-08 04:47:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 102 states have internal predecessors, (137), 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-08 04:47:07,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 137 transitions. [2025-03-08 04:47:07,896 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 137 transitions. Word has length 19 [2025-03-08 04:47:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:07,897 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 137 transitions. [2025-03-08 04:47:07,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 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-08 04:47:07,897 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2025-03-08 04:47:07,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:47:07,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:07,897 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:07,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:08,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 04:47:08,102 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:08,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:08,102 INFO L85 PathProgramCache]: Analyzing trace with hash 805320152, now seen corresponding path program 4 times [2025-03-08 04:47:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:08,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444296197] [2025-03-08 04:47:08,102 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:08,105 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 04:47:08,110 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:47:08,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:08,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444296197] [2025-03-08 04:47:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444296197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:08,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299305117] [2025-03-08 04:47:08,154 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:08,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:08,156 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:08,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 04:47:08,177 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-03-08 04:47:08,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:47:08,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:08,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:08,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 04:47:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:08,203 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:08,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299305117] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:08,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-08 04:47:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364756770] [2025-03-08 04:47:08,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:08,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 04:47:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:08,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 04:47:08,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:47:08,227 INFO L87 Difference]: Start difference. First operand 103 states and 137 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 04:47:08,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:08,263 INFO L93 Difference]: Finished difference Result 134 states and 178 transitions. [2025-03-08 04:47:08,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 04:47:08,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) Word has length 20 [2025-03-08 04:47:08,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:08,264 INFO L225 Difference]: With dead ends: 134 [2025-03-08 04:47:08,264 INFO L226 Difference]: Without dead ends: 111 [2025-03-08 04:47:08,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 04:47:08,264 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:08,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 43 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:08,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-08 04:47:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-08 04:47:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 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-08 04:47:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2025-03-08 04:47:08,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 20 [2025-03-08 04:47:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:08,285 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2025-03-08 04:47:08,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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-08 04:47:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2025-03-08 04:47:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:47:08,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:08,285 INFO L218 NwaCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:08,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:08,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 04:47:08,489 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:08,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1784174969, now seen corresponding path program 5 times [2025-03-08 04:47:08,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:08,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317248384] [2025-03-08 04:47:08,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:08,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:08,493 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 4 equivalence classes. [2025-03-08 04:47:08,498 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:47:08,498 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:08,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:47:08,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317248384] [2025-03-08 04:47:08,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317248384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:08,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592359944] [2025-03-08 04:47:08,603 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:08,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:08,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:08,604 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:08,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 04:47:08,627 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 4 equivalence classes. [2025-03-08 04:47:08,636 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:47:08,636 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:08,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:08,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 04:47:08,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:47:08,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:08,749 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592359944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:08,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:08,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 7] total 20 [2025-03-08 04:47:08,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437238622] [2025-03-08 04:47:08,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:08,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 04:47:08,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:08,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 04:47:08,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2025-03-08 04:47:08,751 INFO L87 Difference]: Start difference. First operand 111 states and 146 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-08 04:47:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:09,291 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2025-03-08 04:47:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 04:47:09,292 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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) Word has length 20 [2025-03-08 04:47:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:09,293 INFO L225 Difference]: With dead ends: 224 [2025-03-08 04:47:09,293 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 04:47:09,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=367, Invalid=1795, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 04:47:09,294 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:09,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 113 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:47:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 04:47:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 114. [2025-03-08 04:47:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 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-08 04:47:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2025-03-08 04:47:09,315 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 20 [2025-03-08 04:47:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2025-03-08 04:47:09,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 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-08 04:47:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2025-03-08 04:47:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 04:47:09,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:09,316 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:09,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:09,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 04:47:09,517 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash -410072855, now seen corresponding path program 5 times [2025-03-08 04:47:09,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:09,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-03-08 04:47:09,517 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:09,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:09,519 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-08 04:47:09,524 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:47:09,524 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:09,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:47:09,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651903947] [2025-03-08 04:47:09,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651903947] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:09,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161653143] [2025-03-08 04:47:09,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:09,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:09,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:09,639 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:09,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 04:47:09,660 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 4 equivalence classes. [2025-03-08 04:47:09,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 04:47:09,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:09,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:09,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 04:47:09,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 04:47:09,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:09,771 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 04:47:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161653143] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:09,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:09,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 6] total 19 [2025-03-08 04:47:09,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028151970] [2025-03-08 04:47:09,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:09,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:47:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:47:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:47:09,773 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-08 04:47:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:09,983 INFO L93 Difference]: Finished difference Result 246 states and 351 transitions. [2025-03-08 04:47:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:47:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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) Word has length 21 [2025-03-08 04:47:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:09,985 INFO L225 Difference]: With dead ends: 246 [2025-03-08 04:47:09,985 INFO L226 Difference]: Without dead ends: 199 [2025-03-08 04:47:09,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-03-08 04:47:09,985 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:09,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 139 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:47:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-08 04:47:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 119. [2025-03-08 04:47:10,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.305084745762712) internal successors, (154), 118 states have internal predecessors, (154), 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-08 04:47:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 154 transitions. [2025-03-08 04:47:10,008 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 154 transitions. Word has length 21 [2025-03-08 04:47:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:10,008 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 154 transitions. [2025-03-08 04:47:10,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-08 04:47:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 154 transitions. [2025-03-08 04:47:10,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:47:10,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:10,009 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:10,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:10,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:10,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:10,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 3027736, now seen corresponding path program 6 times [2025-03-08 04:47:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653625769] [2025-03-08 04:47:10,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:10,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-03-08 04:47:10,230 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:47:10,231 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 04:47:10,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:10,298 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 04:47:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653625769] [2025-03-08 04:47:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653625769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349815235] [2025-03-08 04:47:10,298 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:10,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:10,300 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:10,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 04:47:10,326 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-03-08 04:47:10,339 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:47:10,339 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 04:47:10,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:10,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:47:10,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 04:47:10,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 04:47:10,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349815235] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:10,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:10,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-08 04:47:10,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724593277] [2025-03-08 04:47:10,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:10,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:47:10,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:10,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:47:10,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:47:10,489 INFO L87 Difference]: Start difference. First operand 119 states and 154 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-08 04:47:11,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:11,262 INFO L93 Difference]: Finished difference Result 200 states and 267 transitions. [2025-03-08 04:47:11,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 04:47:11,262 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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) Word has length 22 [2025-03-08 04:47:11,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:11,263 INFO L225 Difference]: With dead ends: 200 [2025-03-08 04:47:11,263 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 04:47:11,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=323, Invalid=2329, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 04:47:11,264 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:11,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 108 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:47:11,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 04:47:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 126. [2025-03-08 04:47:11,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 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-08 04:47:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2025-03-08 04:47:11,302 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 22 [2025-03-08 04:47:11,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:11,302 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2025-03-08 04:47:11,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-08 04:47:11,302 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2025-03-08 04:47:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:47:11,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:11,302 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:11,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:11,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:11,503 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:11,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 500602248, now seen corresponding path program 6 times [2025-03-08 04:47:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:11,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528960180] [2025-03-08 04:47:11,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:11,505 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-08 04:47:11,514 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:47:11,514 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 04:47:11,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:11,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528960180] [2025-03-08 04:47:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528960180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:11,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103805131] [2025-03-08 04:47:11,575 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:11,577 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:11,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 04:47:11,601 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 3 equivalence classes. [2025-03-08 04:47:11,613 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:47:11,613 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 04:47:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:11,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 04:47:11,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:47:11,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:47:11,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103805131] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:11,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:11,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-03-08 04:47:11,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994206102] [2025-03-08 04:47:11,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:11,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:47:11,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:11,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:47:11,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:47:11,711 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-08 04:47:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:11,888 INFO L93 Difference]: Finished difference Result 268 states and 374 transitions. [2025-03-08 04:47:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 04:47:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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) Word has length 23 [2025-03-08 04:47:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:11,890 INFO L225 Difference]: With dead ends: 268 [2025-03-08 04:47:11,890 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 04:47:11,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:47:11,890 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:11,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 71 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 04:47:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 201. [2025-03-08 04:47:11,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 200 states have (on average 1.37) internal successors, (274), 200 states have internal predecessors, (274), 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-08 04:47:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2025-03-08 04:47:11,939 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 23 [2025-03-08 04:47:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:11,939 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2025-03-08 04:47:11,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-08 04:47:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2025-03-08 04:47:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:47:11,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:11,939 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:11,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:12,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:12,140 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1837312997, now seen corresponding path program 3 times [2025-03-08 04:47:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939966326] [2025-03-08 04:47:12,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:12,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:12,143 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-08 04:47:12,151 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 24 statements. [2025-03-08 04:47:12,151 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:47:12,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:12,223 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 04:47:12,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939966326] [2025-03-08 04:47:12,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939966326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:12,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783325469] [2025-03-08 04:47:12,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:12,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:12,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:12,225 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:12,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 04:47:12,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 4 equivalence classes. [2025-03-08 04:47:12,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 22 of 24 statements. [2025-03-08 04:47:12,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:47:12,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:12,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 04:47:12,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 04:47:12,280 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 04:47:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783325469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:12,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:12,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-08 04:47:12,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816216080] [2025-03-08 04:47:12,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:12,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:47:12,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:12,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:47:12,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:47:12,344 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-08 04:47:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:12,783 INFO L93 Difference]: Finished difference Result 359 states and 515 transitions. [2025-03-08 04:47:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 04:47:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) Word has length 24 [2025-03-08 04:47:12,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:12,784 INFO L225 Difference]: With dead ends: 359 [2025-03-08 04:47:12,784 INFO L226 Difference]: Without dead ends: 355 [2025-03-08 04:47:12,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=365, Unknown=0, NotChecked=0, Total=552 [2025-03-08 04:47:12,785 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:12,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 95 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:47:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-08 04:47:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 254. [2025-03-08 04:47:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.4387351778656126) internal successors, (364), 253 states have internal predecessors, (364), 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-08 04:47:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 364 transitions. [2025-03-08 04:47:12,859 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 364 transitions. Word has length 24 [2025-03-08 04:47:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:12,859 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 364 transitions. [2025-03-08 04:47:12,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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-08 04:47:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 364 transitions. [2025-03-08 04:47:12,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 04:47:12,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:12,860 INFO L218 NwaCegarLoop]: trace histogram [7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:12,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 04:47:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:13,060 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:13,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1101793785, now seen corresponding path program 7 times [2025-03-08 04:47:13,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105628469] [2025-03-08 04:47:13,061 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:47:13,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:47:13,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:13,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105628469] [2025-03-08 04:47:13,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105628469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:13,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136490149] [2025-03-08 04:47:13,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:13,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:13,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:13,169 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:13,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 04:47:13,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 04:47:13,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 04:47:13,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:13,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:13,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 04:47:13,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:13,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 04:47:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136490149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:13,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:13,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 23 [2025-03-08 04:47:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290366465] [2025-03-08 04:47:13,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 04:47:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:13,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 04:47:13,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-08 04:47:13,378 INFO L87 Difference]: Start difference. First operand 254 states and 364 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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-08 04:47:14,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:14,119 INFO L93 Difference]: Finished difference Result 550 states and 789 transitions. [2025-03-08 04:47:14,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 04:47:14,119 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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) Word has length 24 [2025-03-08 04:47:14,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:14,122 INFO L225 Difference]: With dead ends: 550 [2025-03-08 04:47:14,122 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 04:47:14,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 04:47:14,124 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 39 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:14,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 214 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:47:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 04:47:14,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 291. [2025-03-08 04:47:14,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 290 states have (on average 1.4344827586206896) internal successors, (416), 290 states have internal predecessors, (416), 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-08 04:47:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 416 transitions. [2025-03-08 04:47:14,210 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 416 transitions. Word has length 24 [2025-03-08 04:47:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:14,210 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 416 transitions. [2025-03-08 04:47:14,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 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-08 04:47:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 416 transitions. [2025-03-08 04:47:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:47:14,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:14,210 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:14,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:14,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:14,411 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:14,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:14,411 INFO L85 PathProgramCache]: Analyzing trace with hash -296746646, now seen corresponding path program 4 times [2025-03-08 04:47:14,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277739976] [2025-03-08 04:47:14,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:14,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:47:14,418 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:47:14,418 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:14,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 04:47:14,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277739976] [2025-03-08 04:47:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277739976] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:14,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100075404] [2025-03-08 04:47:14,509 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:14,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:14,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:14,510 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:14,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 04:47:14,532 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:47:14,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:47:14,542 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:14,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:14,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 04:47:14,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:47:14,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:47:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100075404] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:14,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 26 [2025-03-08 04:47:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373922152] [2025-03-08 04:47:14,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:14,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 04:47:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:14,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 04:47:14,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2025-03-08 04:47:14,781 INFO L87 Difference]: Start difference. First operand 291 states and 416 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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-08 04:47:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:19,921 INFO L93 Difference]: Finished difference Result 709 states and 991 transitions. [2025-03-08 04:47:19,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2025-03-08 04:47:19,922 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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) Word has length 27 [2025-03-08 04:47:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:19,924 INFO L225 Difference]: With dead ends: 709 [2025-03-08 04:47:19,924 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 04:47:19,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13892 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4282, Invalid=31628, Unknown=0, NotChecked=0, Total=35910 [2025-03-08 04:47:19,930 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 380 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:19,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 133 Invalid, 1165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 04:47:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 04:47:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 323. [2025-03-08 04:47:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 1.4192546583850931) internal successors, (457), 322 states have internal predecessors, (457), 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-08 04:47:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 457 transitions. [2025-03-08 04:47:20,061 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 457 transitions. Word has length 27 [2025-03-08 04:47:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:20,061 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 457 transitions. [2025-03-08 04:47:20,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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-08 04:47:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 457 transitions. [2025-03-08 04:47:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:47:20,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:20,062 INFO L218 NwaCegarLoop]: trace histogram [8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:20,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 04:47:20,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:20,262 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -76730550, now seen corresponding path program 8 times [2025-03-08 04:47:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:20,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-03-08 04:47:20,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:20,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:47:20,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:47:20,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:20,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 04:47:20,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607028511] [2025-03-08 04:47:20,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607028511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:20,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674552938] [2025-03-08 04:47:20,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:20,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:20,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:20,365 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:20,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 04:47:20,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:47:20,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:47:20,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:20,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:20,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-08 04:47:20,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 04:47:20,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:47:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674552938] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:20,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:20,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 8] total 21 [2025-03-08 04:47:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416533182] [2025-03-08 04:47:20,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 04:47:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:20,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 04:47:20,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:47:20,529 INFO L87 Difference]: Start difference. First operand 323 states and 457 transitions. Second operand has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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-08 04:47:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:21,032 INFO L93 Difference]: Finished difference Result 659 states and 933 transitions. [2025-03-08 04:47:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 04:47:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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) Word has length 27 [2025-03-08 04:47:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:21,034 INFO L225 Difference]: With dead ends: 659 [2025-03-08 04:47:21,034 INFO L226 Difference]: Without dead ends: 555 [2025-03-08 04:47:21,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=376, Unknown=0, NotChecked=0, Total=552 [2025-03-08 04:47:21,035 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:21,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 198 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:47:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-08 04:47:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 369. [2025-03-08 04:47:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.3532608695652173) internal successors, (498), 368 states have internal predecessors, (498), 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-08 04:47:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 498 transitions. [2025-03-08 04:47:21,167 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 498 transitions. Word has length 27 [2025-03-08 04:47:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:21,167 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 498 transitions. [2025-03-08 04:47:21,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 states have internal predecessors, (38), 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-08 04:47:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 498 transitions. [2025-03-08 04:47:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:47:21,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:21,168 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:21,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:21,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-08 04:47:21,369 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:21,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1741790568, now seen corresponding path program 9 times [2025-03-08 04:47:21,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:21,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651675695] [2025-03-08 04:47:21,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:21,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:21,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-08 04:47:21,385 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:47:21,385 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:47:21,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 04:47:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651675695] [2025-03-08 04:47:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651675695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957559218] [2025-03-08 04:47:21,458 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:47:21,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:21,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:21,460 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:21,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 04:47:21,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 3 equivalence classes. [2025-03-08 04:47:21,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:47:21,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:47:21,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:21,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:47:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 04:47:21,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 04:47:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957559218] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:21,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-03-08 04:47:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316951282] [2025-03-08 04:47:21,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:21,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:47:21,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:21,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:47:21,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:47:21,636 INFO L87 Difference]: Start difference. First operand 369 states and 498 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-08 04:47:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:22,021 INFO L93 Difference]: Finished difference Result 594 states and 842 transitions. [2025-03-08 04:47:22,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 04:47:22,021 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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) Word has length 28 [2025-03-08 04:47:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:22,023 INFO L225 Difference]: With dead ends: 594 [2025-03-08 04:47:22,023 INFO L226 Difference]: Without dead ends: 549 [2025-03-08 04:47:22,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-03-08 04:47:22,024 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:22,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 79 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-03-08 04:47:22,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 488. [2025-03-08 04:47:22,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 1.373716632443532) internal successors, (669), 487 states have internal predecessors, (669), 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-08 04:47:22,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 669 transitions. [2025-03-08 04:47:22,258 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 669 transitions. Word has length 28 [2025-03-08 04:47:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:22,258 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 669 transitions. [2025-03-08 04:47:22,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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-08 04:47:22,258 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 669 transitions. [2025-03-08 04:47:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 04:47:22,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:22,258 INFO L218 NwaCegarLoop]: trace histogram [7, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:22,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:22,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 04:47:22,463 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1897699608, now seen corresponding path program 5 times [2025-03-08 04:47:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:22,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684732339] [2025-03-08 04:47:22,463 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:22,466 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-03-08 04:47:22,482 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:47:22,483 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 04:47:22,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 04:47:22,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684732339] [2025-03-08 04:47:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684732339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:22,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879867272] [2025-03-08 04:47:22,613 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:22,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:22,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:22,615 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:22,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 04:47:22,638 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 5 equivalence classes. [2025-03-08 04:47:22,684 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 04:47:22,684 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 04:47:22,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:22,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 04:47:22,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 04:47:22,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:23,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 04:47:23,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879867272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:23,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:23,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2025-03-08 04:47:23,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891159252] [2025-03-08 04:47:23,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:23,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 04:47:23,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:23,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 04:47:23,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 04:47:23,002 INFO L87 Difference]: Start difference. First operand 488 states and 669 transitions. Second operand has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 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-08 04:47:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:24,563 INFO L93 Difference]: Finished difference Result 797 states and 1088 transitions. [2025-03-08 04:47:24,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-08 04:47:24,563 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 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) Word has length 29 [2025-03-08 04:47:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:24,565 INFO L225 Difference]: With dead ends: 797 [2025-03-08 04:47:24,566 INFO L226 Difference]: Without dead ends: 678 [2025-03-08 04:47:24,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1933 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1154, Invalid=6502, Unknown=0, NotChecked=0, Total=7656 [2025-03-08 04:47:24,568 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 148 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:24,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:47:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-08 04:47:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 485. [2025-03-08 04:47:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 1.3553719008264462) internal successors, (656), 484 states have internal predecessors, (656), 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-08 04:47:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 656 transitions. [2025-03-08 04:47:24,768 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 656 transitions. Word has length 29 [2025-03-08 04:47:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:24,768 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 656 transitions. [2025-03-08 04:47:24,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 34 states have internal predecessors, (49), 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-08 04:47:24,768 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 656 transitions. [2025-03-08 04:47:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:47:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:24,769 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:24,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:24,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 04:47:24,969 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:24,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -916056147, now seen corresponding path program 6 times [2025-03-08 04:47:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:24,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046654177] [2025-03-08 04:47:24,970 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:24,974 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-08 04:47:24,983 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:47:24,983 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 04:47:24,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 04:47:25,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046654177] [2025-03-08 04:47:25,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046654177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:25,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517417279] [2025-03-08 04:47:25,130 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:25,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:25,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:25,133 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 04:47:25,157 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-08 04:47:25,185 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:47:25,186 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 04:47:25,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:25,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-08 04:47:25,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:47:25,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-08 04:47:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517417279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:25,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 18] total 44 [2025-03-08 04:47:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134962207] [2025-03-08 04:47:25,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:25,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 04:47:25,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:25,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 04:47:25,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=1497, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 04:47:25,827 INFO L87 Difference]: Start difference. First operand 485 states and 656 transitions. Second operand has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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-08 04:47:28,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:28,821 INFO L93 Difference]: Finished difference Result 663 states and 888 transitions. [2025-03-08 04:47:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-08 04:47:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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) Word has length 31 [2025-03-08 04:47:28,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:28,824 INFO L225 Difference]: With dead ends: 663 [2025-03-08 04:47:28,824 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 04:47:28,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3892 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2612, Invalid=10270, Unknown=0, NotChecked=0, Total=12882 [2025-03-08 04:47:28,825 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:28,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 163 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:47:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 04:47:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 508. [2025-03-08 04:47:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 1.3510848126232742) internal successors, (685), 507 states have internal predecessors, (685), 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-08 04:47:29,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 685 transitions. [2025-03-08 04:47:29,066 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 685 transitions. Word has length 31 [2025-03-08 04:47:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 685 transitions. [2025-03-08 04:47:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 44 states have internal predecessors, (66), 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-08 04:47:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 685 transitions. [2025-03-08 04:47:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:47:29,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:29,067 INFO L218 NwaCegarLoop]: trace histogram [10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:29,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-08 04:47:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:29,268 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1800631249, now seen corresponding path program 10 times [2025-03-08 04:47:29,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:29,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428686720] [2025-03-08 04:47:29,268 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:29,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:29,271 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:47:29,277 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:47:29,277 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:29,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428686720] [2025-03-08 04:47:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428686720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656114251] [2025-03-08 04:47:29,421 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:47:29,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:29,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:29,423 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:29,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 04:47:29,447 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-08 04:47:29,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:47:29,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:47:29,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 04:47:29,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:29,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:29,726 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-08 04:47:29,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656114251] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:29,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 11] total 30 [2025-03-08 04:47:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624147751] [2025-03-08 04:47:29,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 04:47:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 04:47:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2025-03-08 04:47:29,727 INFO L87 Difference]: Start difference. First operand 508 states and 685 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 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-08 04:47:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:31,510 INFO L93 Difference]: Finished difference Result 897 states and 1272 transitions. [2025-03-08 04:47:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-08 04:47:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 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) Word has length 31 [2025-03-08 04:47:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:31,513 INFO L225 Difference]: With dead ends: 897 [2025-03-08 04:47:31,513 INFO L226 Difference]: Without dead ends: 700 [2025-03-08 04:47:31,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=544, Invalid=5462, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 04:47:31,514 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:31,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 405 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 04:47:31,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-03-08 04:47:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 534. [2025-03-08 04:47:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.3958724202626642) internal successors, (744), 533 states have internal predecessors, (744), 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-08 04:47:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 744 transitions. [2025-03-08 04:47:31,833 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 744 transitions. Word has length 31 [2025-03-08 04:47:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:31,833 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 744 transitions. [2025-03-08 04:47:31,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 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-08 04:47:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 744 transitions. [2025-03-08 04:47:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:47:31,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:31,834 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:31,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:32,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 04:47:32,034 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:32,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1106321016, now seen corresponding path program 11 times [2025-03-08 04:47:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:32,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189121461] [2025-03-08 04:47:32,035 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:32,037 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-08 04:47:32,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:47:32,050 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:32,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:47:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189121461] [2025-03-08 04:47:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189121461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474503474] [2025-03-08 04:47:32,141 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:47:32,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:32,143 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:32,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 04:47:32,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 4 equivalence classes. [2025-03-08 04:47:32,217 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:47:32,218 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 04:47:32,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:32,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 04:47:32,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:47:32,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:32,313 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 04:47:32,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474503474] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:32,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:32,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-08 04:47:32,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965942284] [2025-03-08 04:47:32,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:32,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:47:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:32,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:47:32,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:32,314 INFO L87 Difference]: Start difference. First operand 534 states and 744 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-08 04:47:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:32,703 INFO L93 Difference]: Finished difference Result 598 states and 826 transitions. [2025-03-08 04:47:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:47:32,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) Word has length 33 [2025-03-08 04:47:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:32,705 INFO L225 Difference]: With dead ends: 598 [2025-03-08 04:47:32,706 INFO L226 Difference]: Without dead ends: 578 [2025-03-08 04:47:32,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:47:32,706 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:32,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 76 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-08 04:47:32,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 552. [2025-03-08 04:47:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 551 states have (on average 1.3938294010889292) internal successors, (768), 551 states have internal predecessors, (768), 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-08 04:47:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 768 transitions. [2025-03-08 04:47:32,994 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 768 transitions. Word has length 33 [2025-03-08 04:47:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 768 transitions. [2025-03-08 04:47:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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-08 04:47:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 768 transitions. [2025-03-08 04:47:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 04:47:32,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:32,995 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:33,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:33,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 04:47:33,199 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2116440248, now seen corresponding path program 7 times [2025-03-08 04:47:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303250004] [2025-03-08 04:47:33,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:33,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:47:33,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:47:33,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:33,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:47:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303250004] [2025-03-08 04:47:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303250004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408549261] [2025-03-08 04:47:33,379 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:33,381 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:33,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 04:47:33,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 04:47:33,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 04:47:33,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:33,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:33,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 04:47:33,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 04:47:33,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:33,794 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 04:47:33,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408549261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:33,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:33,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 27 [2025-03-08 04:47:33,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206896605] [2025-03-08 04:47:33,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:33,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 04:47:33,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:33,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 04:47:33,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2025-03-08 04:47:33,795 INFO L87 Difference]: Start difference. First operand 552 states and 768 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 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-08 04:47:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:37,381 INFO L93 Difference]: Finished difference Result 834 states and 1148 transitions. [2025-03-08 04:47:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2025-03-08 04:47:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 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) Word has length 33 [2025-03-08 04:47:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:37,384 INFO L225 Difference]: With dead ends: 834 [2025-03-08 04:47:37,384 INFO L226 Difference]: Without dead ends: 735 [2025-03-08 04:47:37,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 53 SyntacticMatches, 14 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6923 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1229, Invalid=19651, Unknown=0, NotChecked=0, Total=20880 [2025-03-08 04:47:37,386 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 150 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2634 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 2634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:37,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 116 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 2634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 04:47:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-08 04:47:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 542. [2025-03-08 04:47:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.365988909426987) internal successors, (739), 541 states have internal predecessors, (739), 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-08 04:47:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 739 transitions. [2025-03-08 04:47:37,714 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 739 transitions. Word has length 33 [2025-03-08 04:47:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:37,714 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 739 transitions. [2025-03-08 04:47:37,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 27 states have internal predecessors, (55), 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-08 04:47:37,714 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 739 transitions. [2025-03-08 04:47:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:47:37,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:37,715 INFO L218 NwaCegarLoop]: trace histogram [11, 8, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:37,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 04:47:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:37,916 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1077623256, now seen corresponding path program 8 times [2025-03-08 04:47:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737597240] [2025-03-08 04:47:37,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:37,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 04:47:37,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:47:37,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:37,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 04:47:38,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737597240] [2025-03-08 04:47:38,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737597240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:38,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194178325] [2025-03-08 04:47:38,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:38,180 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:38,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 04:47:38,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 04:47:38,218 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:47:38,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:38,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 04:47:38,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:38,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 32 proven. 64 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 04:47:38,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194178325] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:38,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 32 [2025-03-08 04:47:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104953404] [2025-03-08 04:47:38,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:38,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 04:47:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 04:47:38,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:47:38,704 INFO L87 Difference]: Start difference. First operand 542 states and 739 transitions. Second operand has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 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-08 04:47:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:44,492 INFO L93 Difference]: Finished difference Result 982 states and 1378 transitions. [2025-03-08 04:47:44,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-03-08 04:47:44,492 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 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) Word has length 34 [2025-03-08 04:47:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:44,494 INFO L225 Difference]: With dead ends: 982 [2025-03-08 04:47:44,494 INFO L226 Difference]: Without dead ends: 809 [2025-03-08 04:47:44,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 56 SyntacticMatches, 16 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8247 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1965, Invalid=22841, Unknown=0, NotChecked=0, Total=24806 [2025-03-08 04:47:44,496 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 231 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:44,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 256 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 04:47:44,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-08 04:47:44,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 565. [2025-03-08 04:47:44,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.3315602836879432) internal successors, (751), 564 states have internal predecessors, (751), 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-08 04:47:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 751 transitions. [2025-03-08 04:47:44,813 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 751 transitions. Word has length 34 [2025-03-08 04:47:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:44,813 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 751 transitions. [2025-03-08 04:47:44,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 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-08 04:47:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 751 transitions. [2025-03-08 04:47:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:47:44,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:44,813 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:44,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-08 04:47:45,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:45,015 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:45,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:45,016 INFO L85 PathProgramCache]: Analyzing trace with hash -36062072, now seen corresponding path program 12 times [2025-03-08 04:47:45,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:45,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451440129] [2025-03-08 04:47:45,016 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:45,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:45,018 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 4 equivalence classes. [2025-03-08 04:47:45,034 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:47:45,034 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 04:47:45,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:47:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451440129] [2025-03-08 04:47:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451440129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922612002] [2025-03-08 04:47:45,123 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:47:45,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:45,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:45,126 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:45,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 04:47:45,154 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 35 statements into 4 equivalence classes. [2025-03-08 04:47:45,168 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:47:45,168 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 04:47:45,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:45,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 04:47:45,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:47:45,198 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 04:47:45,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922612002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:45,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:45,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2025-03-08 04:47:45,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178698460] [2025-03-08 04:47:45,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:45,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:47:45,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:45,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:47:45,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:45,253 INFO L87 Difference]: Start difference. First operand 565 states and 751 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-08 04:47:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:45,618 INFO L93 Difference]: Finished difference Result 622 states and 823 transitions. [2025-03-08 04:47:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:47:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 35 [2025-03-08 04:47:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:45,621 INFO L225 Difference]: With dead ends: 622 [2025-03-08 04:47:45,621 INFO L226 Difference]: Without dead ends: 576 [2025-03-08 04:47:45,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:47:45,622 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:45,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:47:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-08 04:47:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 546. [2025-03-08 04:47:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.3376146788990826) internal successors, (729), 545 states have internal predecessors, (729), 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-08 04:47:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 729 transitions. [2025-03-08 04:47:45,943 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 729 transitions. Word has length 35 [2025-03-08 04:47:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:45,943 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 729 transitions. [2025-03-08 04:47:45,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-08 04:47:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 729 transitions. [2025-03-08 04:47:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 04:47:45,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:45,944 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:45,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-08 04:47:46,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:46,145 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:46,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:46,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1072553897, now seen corresponding path program 13 times [2025-03-08 04:47:46,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:46,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349883438] [2025-03-08 04:47:46,145 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:46,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:46,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:47:46,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:47:46,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:46,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 04:47:46,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349883438] [2025-03-08 04:47:46,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349883438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:46,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132606940] [2025-03-08 04:47:46,360 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:46,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:46,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:46,362 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:46,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 04:47:46,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 04:47:46,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 04:47:46,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:46,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:46,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-08 04:47:46,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 04:47:46,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 04:47:46,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132606940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:46,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 10] total 32 [2025-03-08 04:47:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877941246] [2025-03-08 04:47:46,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:46,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 04:47:46,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 04:47:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=783, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:47:46,610 INFO L87 Difference]: Start difference. First operand 546 states and 729 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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-08 04:47:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:48,036 INFO L93 Difference]: Finished difference Result 1100 states and 1510 transitions. [2025-03-08 04:47:48,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 04:47:48,036 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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) Word has length 35 [2025-03-08 04:47:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:48,039 INFO L225 Difference]: With dead ends: 1100 [2025-03-08 04:47:48,039 INFO L226 Difference]: Without dead ends: 947 [2025-03-08 04:47:48,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=558, Invalid=1794, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 04:47:48,040 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 164 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:48,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 389 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:47:48,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-08 04:47:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 583. [2025-03-08 04:47:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.309278350515464) internal successors, (762), 582 states have internal predecessors, (762), 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-08 04:47:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 762 transitions. [2025-03-08 04:47:48,368 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 762 transitions. Word has length 35 [2025-03-08 04:47:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:48,368 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 762 transitions. [2025-03-08 04:47:48,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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-08 04:47:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 762 transitions. [2025-03-08 04:47:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:47:48,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:48,369 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:48,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-08 04:47:48,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:48,569 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:48,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:48,570 INFO L85 PathProgramCache]: Analyzing trace with hash 390118869, now seen corresponding path program 7 times [2025-03-08 04:47:48,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:48,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074304431] [2025-03-08 04:47:48,570 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:48,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:48,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:47:48,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:47:48,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:48,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:48,780 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 04:47:48,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074304431] [2025-03-08 04:47:48,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074304431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:48,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647115692] [2025-03-08 04:47:48,781 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 04:47:48,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:48,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:48,783 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:48,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-08 04:47:48,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:47:48,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:47:48,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:47:48,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:48,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 04:47:48,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 04:47:49,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 21 proven. 58 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-08 04:47:49,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647115692] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:49,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:49,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 30 [2025-03-08 04:47:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781700693] [2025-03-08 04:47:49,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 04:47:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 04:47:49,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2025-03-08 04:47:49,319 INFO L87 Difference]: Start difference. First operand 583 states and 762 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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-08 04:47:53,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:47:53,270 INFO L93 Difference]: Finished difference Result 796 states and 1049 transitions. [2025-03-08 04:47:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2025-03-08 04:47:53,271 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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) Word has length 36 [2025-03-08 04:47:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:47:53,273 INFO L225 Difference]: With dead ends: 796 [2025-03-08 04:47:53,273 INFO L226 Difference]: Without dead ends: 691 [2025-03-08 04:47:53,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 58 SyntacticMatches, 16 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3882 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1228, Invalid=12578, Unknown=0, NotChecked=0, Total=13806 [2025-03-08 04:47:53,273 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 04:47:53,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 240 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 04:47:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-08 04:47:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 513. [2025-03-08 04:47:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 512 states have (on average 1.318359375) internal successors, (675), 512 states have internal predecessors, (675), 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-08 04:47:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 675 transitions. [2025-03-08 04:47:53,566 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 675 transitions. Word has length 36 [2025-03-08 04:47:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:47:53,566 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 675 transitions. [2025-03-08 04:47:53,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 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-08 04:47:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 675 transitions. [2025-03-08 04:47:53,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 04:47:53,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:47:53,567 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:47:53,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-08 04:47:53,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-08 04:47:53,767 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:47:53,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:47:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1859225386, now seen corresponding path program 14 times [2025-03-08 04:47:53,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:47:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959281625] [2025-03-08 04:47:53,768 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:47:53,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 04:47:53,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:47:53,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:53,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-08 04:47:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:47:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959281625] [2025-03-08 04:47:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959281625] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:47:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439157828] [2025-03-08 04:47:53,899 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:47:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:47:53,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:47:53,901 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:47:53,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-08 04:47:53,930 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-08 04:47:53,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 04:47:53,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:47:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:47:53,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 04:47:53,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:47:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 04:47:54,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:47:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 04:47:54,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439157828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:47:54,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:47:54,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2025-03-08 04:47:54,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517645457] [2025-03-08 04:47:54,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:47:54,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 04:47:54,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:47:54,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 04:47:54,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 04:47:54,166 INFO L87 Difference]: Start difference. First operand 513 states and 675 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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-08 04:47:55,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:47:59,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:03,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:07,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:12,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:16,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:21,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:25,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 04:48:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:25,464 INFO L93 Difference]: Finished difference Result 989 states and 1354 transitions. [2025-03-08 04:48:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 04:48:25,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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) Word has length 37 [2025-03-08 04:48:25,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:25,466 INFO L225 Difference]: With dead ends: 989 [2025-03-08 04:48:25,467 INFO L226 Difference]: Without dead ends: 935 [2025-03-08 04:48:25,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=337, Invalid=853, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 04:48:25,467 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 41 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:25,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 151 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 30.3s Time] [2025-03-08 04:48:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2025-03-08 04:48:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 783. [2025-03-08 04:48:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.3350383631713556) internal successors, (1044), 782 states have internal predecessors, (1044), 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-08 04:48:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1044 transitions. [2025-03-08 04:48:25,897 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1044 transitions. Word has length 37 [2025-03-08 04:48:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:25,898 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1044 transitions. [2025-03-08 04:48:25,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 17 states have internal predecessors, (39), 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-08 04:48:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1044 transitions. [2025-03-08 04:48:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:48:25,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:25,898 INFO L218 NwaCegarLoop]: trace histogram [10, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:25,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-03-08 04:48:26,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:26,099 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1166882363, now seen corresponding path program 9 times [2025-03-08 04:48:26,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:26,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735788698] [2025-03-08 04:48:26,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:26,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-08 04:48:26,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 38 statements. [2025-03-08 04:48:26,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 04:48:26,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 04:48:26,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735788698] [2025-03-08 04:48:26,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735788698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:26,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733617732] [2025-03-08 04:48:26,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:26,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:26,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:26,244 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:48:26,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-08 04:48:26,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 6 equivalence classes. [2025-03-08 04:48:26,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 38 statements. [2025-03-08 04:48:26,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 04:48:26,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:26,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 04:48:26,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 04:48:26,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 04:48:26,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733617732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:26,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:26,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 21 [2025-03-08 04:48:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719319934] [2025-03-08 04:48:26,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:26,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 04:48:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:26,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 04:48:26,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:48:26,471 INFO L87 Difference]: Start difference. First operand 783 states and 1044 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-08 04:48:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:28,917 INFO L93 Difference]: Finished difference Result 1382 states and 1999 transitions. [2025-03-08 04:48:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 04:48:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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) Word has length 38 [2025-03-08 04:48:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:28,921 INFO L225 Difference]: With dead ends: 1382 [2025-03-08 04:48:28,921 INFO L226 Difference]: Without dead ends: 1367 [2025-03-08 04:48:28,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=818, Invalid=1834, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 04:48:28,922 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 204 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:28,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 202 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 04:48:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-03-08 04:48:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 844. [2025-03-08 04:48:29,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 1.3973902728351126) internal successors, (1178), 843 states have internal predecessors, (1178), 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-08 04:48:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1178 transitions. [2025-03-08 04:48:29,426 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1178 transitions. Word has length 38 [2025-03-08 04:48:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1178 transitions. [2025-03-08 04:48:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 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-08 04:48:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1178 transitions. [2025-03-08 04:48:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:48:29,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:29,427 INFO L218 NwaCegarLoop]: trace histogram [13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:29,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-03-08 04:48:29,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:29,628 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash 974535993, now seen corresponding path program 15 times [2025-03-08 04:48:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320773210] [2025-03-08 04:48:29,628 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:29,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-03-08 04:48:29,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 38 statements. [2025-03-08 04:48:29,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:48:29,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 04:48:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320773210] [2025-03-08 04:48:29,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320773210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14832882] [2025-03-08 04:48:29,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:48:29,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:29,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:29,720 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:48:29,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-08 04:48:29,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 8 equivalence classes. [2025-03-08 04:48:29,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 38 statements. [2025-03-08 04:48:29,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 04:48:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:29,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 04:48:29,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:29,851 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 04:48:29,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-08 04:48:30,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14832882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:30,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:30,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 19 [2025-03-08 04:48:30,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973648656] [2025-03-08 04:48:30,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:30,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 04:48:30,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:30,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 04:48:30,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-08 04:48:30,030 INFO L87 Difference]: Start difference. First operand 844 states and 1178 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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-08 04:48:31,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:48:31,257 INFO L93 Difference]: Finished difference Result 1089 states and 1491 transitions. [2025-03-08 04:48:31,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 04:48:31,257 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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) Word has length 38 [2025-03-08 04:48:31,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:48:31,260 INFO L225 Difference]: With dead ends: 1089 [2025-03-08 04:48:31,260 INFO L226 Difference]: Without dead ends: 995 [2025-03-08 04:48:31,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 52 SyntacticMatches, 18 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-03-08 04:48:31,261 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:48:31,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 123 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:48:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-08 04:48:31,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 838. [2025-03-08 04:48:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.3978494623655915) internal successors, (1170), 837 states have internal predecessors, (1170), 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-08 04:48:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1170 transitions. [2025-03-08 04:48:31,782 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1170 transitions. Word has length 38 [2025-03-08 04:48:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:48:31,782 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1170 transitions. [2025-03-08 04:48:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 states have internal predecessors, (39), 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-08 04:48:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1170 transitions. [2025-03-08 04:48:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:48:31,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:48:31,783 INFO L218 NwaCegarLoop]: trace histogram [13, 10, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:48:31,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-03-08 04:48:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-08 04:48:31,983 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:48:31,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:48:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1655039175, now seen corresponding path program 10 times [2025-03-08 04:48:31,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:48:31,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581648736] [2025-03-08 04:48:31,984 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:48:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:48:31,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:48:31,995 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:48:31,995 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:48:31,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 04:48:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:48:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581648736] [2025-03-08 04:48:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581648736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:48:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350297000] [2025-03-08 04:48:32,277 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:48:32,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:48:32,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:48:32,280 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:48:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-03-08 04:48:32,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-08 04:48:32,321 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:48:32,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:48:32,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:48:32,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-08 04:48:32,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:48:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 100 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 04:48:32,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:48:33,105 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 40 proven. 100 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 04:48:33,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350297000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:48:33,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:48:33,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 13, 13] total 38 [2025-03-08 04:48:33,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343356963] [2025-03-08 04:48:33,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:48:33,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 04:48:33,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:48:33,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 04:48:33,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1323, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 04:48:33,106 INFO L87 Difference]: Start difference. First operand 838 states and 1170 transitions. Second operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 38 states have internal predecessors, (61), 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)