./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label48.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/eca-rers2012/Problem03_label48.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 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:11:51,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:11:51,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:11:51,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:11:51,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:11:51,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:11:51,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:11:51,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:11:51,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:11:51,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:11:51,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:11:51,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:11:51,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:11:51,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:11:51,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:11:51,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:11:51,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:11:51,114 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:11:51,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:51,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:11:51,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:11:51,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:11:51,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:11:51,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:11:51,116 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 -> 3f14d4f9bc9aeaf37fb25f1f86f7bc3a3a5a6ca0e3e96922bca4446f4d37ab9f [2025-03-16 14:11:51,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:51,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:51,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:51,340 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:51,340 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:51,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2025-03-16 14:11:52,507 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56975b29d/b4d8260d917645e79f2432f7174c1c16/FLAG91a8380b6 [2025-03-16 14:11:52,873 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:52,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label48.c [2025-03-16 14:11:52,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56975b29d/b4d8260d917645e79f2432f7174c1c16/FLAG91a8380b6 [2025-03-16 14:11:53,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56975b29d/b4d8260d917645e79f2432f7174c1c16 [2025-03-16 14:11:53,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:53,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:53,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:53,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:53,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:53,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30490454 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53, skipping insertion in model container [2025-03-16 14:11:53,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:53,496 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/eca-rers2012/Problem03_label48.c[58935,58948] [2025-03-16 14:11:53,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:53,537 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:53,662 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/eca-rers2012/Problem03_label48.c[58935,58948] [2025-03-16 14:11:53,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:53,685 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:53,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53 WrapperNode [2025-03-16 14:11:53,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:53,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:53,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:53,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:53,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,802 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:53,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:53,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:53,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:53,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:53,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,857 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-16 14:11:53,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,899 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:53,912 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:53,912 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:53,912 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:53,912 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:53,936 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-16 14:11:53,940 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-16 14:11:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:53,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:53,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:54,012 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:54,013 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:55,339 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:55,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:55,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:55,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:55,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:55 BoogieIcfgContainer [2025-03-16 14:11:55,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:55,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:55,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:55,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:55,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:53" (1/3) ... [2025-03-16 14:11:55,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c8c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:55, skipping insertion in model container [2025-03-16 14:11:55,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (2/3) ... [2025-03-16 14:11:55,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c8c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:55, skipping insertion in model container [2025-03-16 14:11:55,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:55" (3/3) ... [2025-03-16 14:11:55,366 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label48.c [2025-03-16 14:11:55,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:55,381 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label48.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:55,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:55,429 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;@1a9c5b4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:55,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 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-16 14:11:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 14:11:55,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:55,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:55,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash 832282480, now seen corresponding path program 1 times [2025-03-16 14:11:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670028863] [2025-03-16 14:11:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:55,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 14:11:55,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 14:11:55,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:55,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:55,897 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-16 14:11:55,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670028863] [2025-03-16 14:11:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670028863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:55,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:55,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:55,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745119990] [2025-03-16 14:11:55,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:55,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:55,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:55,919 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 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) Second operand has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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-16 14:11:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:55,943 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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 182 [2025-03-16 14:11:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:55,951 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:55,951 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:55,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:55,955 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:55,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-16 14:11:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:55,995 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 182 [2025-03-16 14:11:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:55,995 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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-16 14:11:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-16 14:11:56,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:56,000 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:56,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:56,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:56,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash -738403119, now seen corresponding path program 1 times [2025-03-16 14:11:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610602629] [2025-03-16 14:11:56,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:56,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-16 14:11:56,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-16 14:11:56,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:56,432 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-16 14:11:56,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:56,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610602629] [2025-03-16 14:11:56,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610602629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:56,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:56,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:56,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225939962] [2025-03-16 14:11:56,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:56,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:56,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:56,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:56,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:56,437 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-16 14:11:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:57,152 INFO L93 Difference]: Finished difference Result 698 states and 1151 transitions. [2025-03-16 14:11:57,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:57,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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 182 [2025-03-16 14:11:57,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:57,155 INFO L225 Difference]: With dead ends: 698 [2025-03-16 14:11:57,155 INFO L226 Difference]: Without dead ends: 461 [2025-03-16 14:11:57,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:11:57,156 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 73 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:57,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 149 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-16 14:11:57,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2025-03-16 14:11:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.539301310043668) internal successors, (705), 458 states have internal predecessors, (705), 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-16 14:11:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 705 transitions. [2025-03-16 14:11:57,181 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 705 transitions. Word has length 182 [2025-03-16 14:11:57,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:57,181 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 705 transitions. [2025-03-16 14:11:57,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 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-16 14:11:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 705 transitions. [2025-03-16 14:11:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 14:11:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:57,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:57,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:57,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 701956095, now seen corresponding path program 1 times [2025-03-16 14:11:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489171174] [2025-03-16 14:11:57,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:57,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 14:11:57,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 14:11:57,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:57,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:57,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489171174] [2025-03-16 14:11:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489171174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62864210] [2025-03-16 14:11:57,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:57,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:57,403 INFO L87 Difference]: Start difference. First operand 459 states and 705 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 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-16 14:11:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:58,059 INFO L93 Difference]: Finished difference Result 1343 states and 2078 transitions. [2025-03-16 14:11:58,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 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 190 [2025-03-16 14:11:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:58,062 INFO L225 Difference]: With dead ends: 1343 [2025-03-16 14:11:58,062 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:11:58,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:11:58,063 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:58,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:11:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 869. [2025-03-16 14:11:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5138248847926268) internal successors, (1314), 868 states have internal predecessors, (1314), 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-16 14:11:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1314 transitions. [2025-03-16 14:11:58,083 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1314 transitions. Word has length 190 [2025-03-16 14:11:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:58,083 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1314 transitions. [2025-03-16 14:11:58,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 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-16 14:11:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1314 transitions. [2025-03-16 14:11:58,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-16 14:11:58,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:58,086 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:58,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:58,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1359206014, now seen corresponding path program 1 times [2025-03-16 14:11:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:58,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748962784] [2025-03-16 14:11:58,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:58,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-16 14:11:58,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-16 14:11:58,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:58,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:11:58,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:58,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748962784] [2025-03-16 14:11:58,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748962784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:58,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:58,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:11:58,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089638850] [2025-03-16 14:11:58,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:58,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:11:58,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:58,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:11:58,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:58,617 INFO L87 Difference]: Start difference. First operand 869 states and 1314 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-16 14:11:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:59,340 INFO L93 Difference]: Finished difference Result 1883 states and 2885 transitions. [2025-03-16 14:11:59,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:11:59,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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 197 [2025-03-16 14:11:59,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:59,345 INFO L225 Difference]: With dead ends: 1883 [2025-03-16 14:11:59,345 INFO L226 Difference]: Without dead ends: 841 [2025-03-16 14:11:59,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:11:59,348 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 299 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:59,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 45 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:59,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-16 14:11:59,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2025-03-16 14:11:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.3654761904761905) internal successors, (1147), 840 states have internal predecessors, (1147), 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-16 14:11:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1147 transitions. [2025-03-16 14:11:59,369 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1147 transitions. Word has length 197 [2025-03-16 14:11:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:59,370 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1147 transitions. [2025-03-16 14:11:59,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 3 states have internal predecessors, (192), 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-16 14:11:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1147 transitions. [2025-03-16 14:11:59,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 14:11:59,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:59,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:59,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:59,372 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:59,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1601228350, now seen corresponding path program 1 times [2025-03-16 14:11:59,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186523845] [2025-03-16 14:11:59,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:59,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:59,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 14:11:59,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 14:11:59,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:59,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:59,534 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186523845] [2025-03-16 14:11:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186523845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:59,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:59,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:59,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91012978] [2025-03-16 14:11:59,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:59,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:59,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:59,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:59,536 INFO L87 Difference]: Start difference. First operand 841 states and 1147 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-16 14:12:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:00,090 INFO L93 Difference]: Finished difference Result 2505 states and 3420 transitions. [2025-03-16 14:12:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 205 [2025-03-16 14:12:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:00,096 INFO L225 Difference]: With dead ends: 2505 [2025-03-16 14:12:00,096 INFO L226 Difference]: Without dead ends: 1665 [2025-03-16 14:12:00,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:12:00,098 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 229 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:00,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 69 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2025-03-16 14:12:00,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1662. [2025-03-16 14:12:00,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1661 states have (on average 1.3257074051776039) internal successors, (2202), 1661 states have internal predecessors, (2202), 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-16 14:12:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2202 transitions. [2025-03-16 14:12:00,130 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2202 transitions. Word has length 205 [2025-03-16 14:12:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2202 transitions. [2025-03-16 14:12:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-16 14:12:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2202 transitions. [2025-03-16 14:12:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 14:12:00,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:00,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:12:00,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1870209388, now seen corresponding path program 1 times [2025-03-16 14:12:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387680042] [2025-03-16 14:12:00,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 14:12:00,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 14:12:00,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:00,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:00,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:00,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387680042] [2025-03-16 14:12:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387680042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:00,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752313428] [2025-03-16 14:12:00,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:00,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:00,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:00,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:00,314 INFO L87 Difference]: Start difference. First operand 1662 states and 2202 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-16 14:12:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:00,862 INFO L93 Difference]: Finished difference Result 4155 states and 5493 transitions. [2025-03-16 14:12:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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 210 [2025-03-16 14:12:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:00,868 INFO L225 Difference]: With dead ends: 4155 [2025-03-16 14:12:00,868 INFO L226 Difference]: Without dead ends: 2494 [2025-03-16 14:12:00,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:12:00,871 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:00,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 56 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2494 states. [2025-03-16 14:12:00,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2494 to 2491. [2025-03-16 14:12:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2491 states, 2490 states have (on average 1.316867469879518) internal successors, (3279), 2490 states have internal predecessors, (3279), 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-16 14:12:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3279 transitions. [2025-03-16 14:12:00,909 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3279 transitions. Word has length 210 [2025-03-16 14:12:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:00,910 INFO L471 AbstractCegarLoop]: Abstraction has 2491 states and 3279 transitions. [2025-03-16 14:12:00,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 2 states have internal predecessors, (210), 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-16 14:12:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3279 transitions. [2025-03-16 14:12:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-16 14:12:00,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:00,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:00,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:12:00,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:00,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:00,915 INFO L85 PathProgramCache]: Analyzing trace with hash -809061422, now seen corresponding path program 1 times [2025-03-16 14:12:00,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:00,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404999837] [2025-03-16 14:12:00,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:00,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:00,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-16 14:12:00,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-16 14:12:00,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:00,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404999837] [2025-03-16 14:12:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404999837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724944542] [2025-03-16 14:12:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:01,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:01,295 INFO L87 Difference]: Start difference. First operand 2491 states and 3279 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-16 14:12:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:02,210 INFO L93 Difference]: Finished difference Result 6978 states and 9219 transitions. [2025-03-16 14:12:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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 213 [2025-03-16 14:12:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:02,222 INFO L225 Difference]: With dead ends: 6978 [2025-03-16 14:12:02,222 INFO L226 Difference]: Without dead ends: 4140 [2025-03-16 14:12:02,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:02,227 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 193 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:02,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 127 Invalid, 1236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:12:02,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2025-03-16 14:12:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4139. [2025-03-16 14:12:02,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 1.2974867085548574) internal successors, (5369), 4138 states have internal predecessors, (5369), 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-16 14:12:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 5369 transitions. [2025-03-16 14:12:02,309 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 5369 transitions. Word has length 213 [2025-03-16 14:12:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 4139 states and 5369 transitions. [2025-03-16 14:12:02,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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-16 14:12:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 5369 transitions. [2025-03-16 14:12:02,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 14:12:02,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:02,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:02,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:12:02,317 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:02,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:02,317 INFO L85 PathProgramCache]: Analyzing trace with hash 46344343, now seen corresponding path program 1 times [2025-03-16 14:12:02,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:02,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828347762] [2025-03-16 14:12:02,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:02,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:02,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:12:02,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:12:02,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:02,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828347762] [2025-03-16 14:12:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828347762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021803926] [2025-03-16 14:12:02,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:02,534 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-16 14:12:02,536 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-16 14:12:02,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:12:02,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:12:02,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:02,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:02,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:02,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-16 14:12:02,937 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021803926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:02,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:12:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810991310] [2025-03-16 14:12:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:02,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:02,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:02,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:02,939 INFO L87 Difference]: Start difference. First operand 4139 states and 5369 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-16 14:12:03,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:03,518 INFO L93 Difference]: Finished difference Result 12398 states and 16088 transitions. [2025-03-16 14:12:03,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:03,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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 217 [2025-03-16 14:12:03,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:03,541 INFO L225 Difference]: With dead ends: 12398 [2025-03-16 14:12:03,542 INFO L226 Difference]: Without dead ends: 8260 [2025-03-16 14:12:03,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:03,548 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 72 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:03,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 98 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8260 states. [2025-03-16 14:12:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8260 to 8250. [2025-03-16 14:12:03,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8250 states, 8249 states have (on average 1.262092374833313) internal successors, (10411), 8249 states have internal predecessors, (10411), 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-16 14:12:03,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8250 states to 8250 states and 10411 transitions. [2025-03-16 14:12:03,657 INFO L78 Accepts]: Start accepts. Automaton has 8250 states and 10411 transitions. Word has length 217 [2025-03-16 14:12:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:03,658 INFO L471 AbstractCegarLoop]: Abstraction has 8250 states and 10411 transitions. [2025-03-16 14:12:03,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 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-16 14:12:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 8250 states and 10411 transitions. [2025-03-16 14:12:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-16 14:12:03,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:03,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:12:03,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:03,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:03,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2052094225, now seen corresponding path program 1 times [2025-03-16 14:12:03,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:03,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470572060] [2025-03-16 14:12:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:03,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:03,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 14:12:03,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 14:12:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:04,547 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:04,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:04,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470572060] [2025-03-16 14:12:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470572060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228091123] [2025-03-16 14:12:04,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:04,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:04,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:04,550 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-16 14:12:04,551 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-16 14:12:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-16 14:12:04,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-16 14:12:04,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:04,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:04,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 14:12:04,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228091123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:04,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:04,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995786576] [2025-03-16 14:12:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:04,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:04,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:04,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:04,841 INFO L87 Difference]: Start difference. First operand 8250 states and 10411 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-16 14:12:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:05,368 INFO L93 Difference]: Finished difference Result 16512 states and 20845 transitions. [2025-03-16 14:12:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:05,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 220 [2025-03-16 14:12:05,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:05,388 INFO L225 Difference]: With dead ends: 16512 [2025-03-16 14:12:05,388 INFO L226 Difference]: Without dead ends: 8263 [2025-03-16 14:12:05,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:05,397 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 41 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:05,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 305 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2025-03-16 14:12:05,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 8250. [2025-03-16 14:12:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8250 states, 8249 states have (on average 1.2523942296035884) internal successors, (10331), 8249 states have internal predecessors, (10331), 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-16 14:12:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8250 states to 8250 states and 10331 transitions. [2025-03-16 14:12:05,504 INFO L78 Accepts]: Start accepts. Automaton has 8250 states and 10331 transitions. Word has length 220 [2025-03-16 14:12:05,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:05,505 INFO L471 AbstractCegarLoop]: Abstraction has 8250 states and 10331 transitions. [2025-03-16 14:12:05,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-16 14:12:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 8250 states and 10331 transitions. [2025-03-16 14:12:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 14:12:05,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:05,516 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:05,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:12:05,721 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,SelfDestructingSolverStorable8 [2025-03-16 14:12:05,721 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:05,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -77763976, now seen corresponding path program 1 times [2025-03-16 14:12:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:05,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231155585] [2025-03-16 14:12:05,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:05,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:12:05,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:12:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:05,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:06,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:06,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231155585] [2025-03-16 14:12:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231155585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173045471] [2025-03-16 14:12:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:06,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:06,418 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-16 14:12:06,420 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-16 14:12:06,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 14:12:06,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 14:12:06,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:06,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:06,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:06,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 14:12:06,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:06,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173045471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:06,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:06,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:06,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138283313] [2025-03-16 14:12:06,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:06,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:06,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:06,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:06,692 INFO L87 Difference]: Start difference. First operand 8250 states and 10331 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-16 14:12:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:07,184 INFO L93 Difference]: Finished difference Result 24422 states and 30585 transitions. [2025-03-16 14:12:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:07,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 226 [2025-03-16 14:12:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:07,208 INFO L225 Difference]: With dead ends: 24422 [2025-03-16 14:12:07,209 INFO L226 Difference]: Without dead ends: 16173 [2025-03-16 14:12:07,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:07,218 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 36 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:07,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 340 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16173 states. [2025-03-16 14:12:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16173 to 16167. [2025-03-16 14:12:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16167 states, 16166 states have (on average 1.1585426203142397) internal successors, (18729), 16166 states have internal predecessors, (18729), 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-16 14:12:07,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16167 states to 16167 states and 18729 transitions. [2025-03-16 14:12:07,406 INFO L78 Accepts]: Start accepts. Automaton has 16167 states and 18729 transitions. Word has length 226 [2025-03-16 14:12:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:07,406 INFO L471 AbstractCegarLoop]: Abstraction has 16167 states and 18729 transitions. [2025-03-16 14:12:07,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-16 14:12:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 16167 states and 18729 transitions. [2025-03-16 14:12:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-16 14:12:07,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:07,422 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:07,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:07,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:07,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:07,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:07,624 INFO L85 PathProgramCache]: Analyzing trace with hash 913065396, now seen corresponding path program 1 times [2025-03-16 14:12:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701072276] [2025-03-16 14:12:07,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:07,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-16 14:12:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-16 14:12:07,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:07,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:07,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701072276] [2025-03-16 14:12:07,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701072276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:07,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:07,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189937881] [2025-03-16 14:12:07,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:07,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:07,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:07,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:07,758 INFO L87 Difference]: Start difference. First operand 16167 states and 18729 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-16 14:12:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:08,223 INFO L93 Difference]: Finished difference Result 31697 states and 36610 transitions. [2025-03-16 14:12:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:08,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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 236 [2025-03-16 14:12:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:08,246 INFO L225 Difference]: With dead ends: 31697 [2025-03-16 14:12:08,246 INFO L226 Difference]: Without dead ends: 15531 [2025-03-16 14:12:08,259 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-16 14:12:08,260 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 236 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:08,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 313 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2025-03-16 14:12:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 15522. [2025-03-16 14:12:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15522 states, 15521 states have (on average 1.129952966948006) internal successors, (17538), 15521 states have internal predecessors, (17538), 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-16 14:12:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15522 states to 15522 states and 17538 transitions. [2025-03-16 14:12:08,403 INFO L78 Accepts]: Start accepts. Automaton has 15522 states and 17538 transitions. Word has length 236 [2025-03-16 14:12:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 15522 states and 17538 transitions. [2025-03-16 14:12:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 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-16 14:12:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15522 states and 17538 transitions. [2025-03-16 14:12:08,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 14:12:08,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:08,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:08,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:12:08,418 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:08,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash -203969878, now seen corresponding path program 1 times [2025-03-16 14:12:08,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:08,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717850176] [2025-03-16 14:12:08,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:08,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:08,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 14:12:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 14:12:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:08,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:08,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717850176] [2025-03-16 14:12:08,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717850176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:08,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:08,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:08,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974950632] [2025-03-16 14:12:08,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:08,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:08,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:08,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:08,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:08,675 INFO L87 Difference]: Start difference. First operand 15522 states and 17538 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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-16 14:12:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:09,148 INFO L93 Difference]: Finished difference Result 38598 states and 43475 transitions. [2025-03-16 14:12:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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 245 [2025-03-16 14:12:09,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:09,182 INFO L225 Difference]: With dead ends: 38598 [2025-03-16 14:12:09,182 INFO L226 Difference]: Without dead ends: 23077 [2025-03-16 14:12:09,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-16 14:12:09,197 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:09,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 118 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23077 states. [2025-03-16 14:12:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23077 to 23070. [2025-03-16 14:12:09,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23070 states, 23069 states have (on average 1.1182105856344011) internal successors, (25796), 23069 states have internal predecessors, (25796), 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-16 14:12:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23070 states to 23070 states and 25796 transitions. [2025-03-16 14:12:09,400 INFO L78 Accepts]: Start accepts. Automaton has 23070 states and 25796 transitions. Word has length 245 [2025-03-16 14:12:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:09,401 INFO L471 AbstractCegarLoop]: Abstraction has 23070 states and 25796 transitions. [2025-03-16 14:12:09,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 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-16 14:12:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23070 states and 25796 transitions. [2025-03-16 14:12:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 14:12:09,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:09,480 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:09,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:12:09,480 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:09,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:09,481 INFO L85 PathProgramCache]: Analyzing trace with hash 455395783, now seen corresponding path program 1 times [2025-03-16 14:12:09,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:09,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477984895] [2025-03-16 14:12:09,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:09,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:09,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 14:12:09,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 14:12:09,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:09,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:09,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:09,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477984895] [2025-03-16 14:12:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477984895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:09,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26035751] [2025-03-16 14:12:09,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:09,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:09,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:09,840 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-16 14:12:09,842 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-16 14:12:09,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 14:12:09,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 14:12:09,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:09,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:09,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:09,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:10,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:10,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26035751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:10,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590266734] [2025-03-16 14:12:10,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:10,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:10,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:10,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:10,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:10,105 INFO L87 Difference]: Start difference. First operand 23070 states and 25796 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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-16 14:12:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:10,656 INFO L93 Difference]: Finished difference Result 54874 states and 61478 transitions. [2025-03-16 14:12:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:10,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 252 [2025-03-16 14:12:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:10,706 INFO L225 Difference]: With dead ends: 54874 [2025-03-16 14:12:10,706 INFO L226 Difference]: Without dead ends: 31805 [2025-03-16 14:12:10,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:10,724 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 156 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:10,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 102 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31805 states. [2025-03-16 14:12:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31805 to 30175. [2025-03-16 14:12:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30175 states, 30174 states have (on average 1.1125472260886857) internal successors, (33570), 30174 states have internal predecessors, (33570), 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-16 14:12:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30175 states to 30175 states and 33570 transitions. [2025-03-16 14:12:11,025 INFO L78 Accepts]: Start accepts. Automaton has 30175 states and 33570 transitions. Word has length 252 [2025-03-16 14:12:11,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:11,027 INFO L471 AbstractCegarLoop]: Abstraction has 30175 states and 33570 transitions. [2025-03-16 14:12:11,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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-16 14:12:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30175 states and 33570 transitions. [2025-03-16 14:12:11,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-16 14:12:11,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:11,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:11,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 14:12:11,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:11,246 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:11,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:11,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2076430515, now seen corresponding path program 1 times [2025-03-16 14:12:11,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:11,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881580401] [2025-03-16 14:12:11,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:11,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-16 14:12:11,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-16 14:12:11,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:11,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:11,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:11,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881580401] [2025-03-16 14:12:11,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881580401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:11,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:11,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:11,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082777440] [2025-03-16 14:12:11,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:11,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:11,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:11,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:11,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:11,377 INFO L87 Difference]: Start difference. First operand 30175 states and 33570 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-16 14:12:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:11,955 INFO L93 Difference]: Finished difference Result 56664 states and 63074 transitions. [2025-03-16 14:12:11,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:11,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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 278 [2025-03-16 14:12:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:11,985 INFO L225 Difference]: With dead ends: 56664 [2025-03-16 14:12:11,986 INFO L226 Difference]: Without dead ends: 26490 [2025-03-16 14:12:12,003 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-16 14:12:12,003 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 60 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:12,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 314 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:12,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26490 states. [2025-03-16 14:12:12,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26490 to 26487. [2025-03-16 14:12:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26487 states, 26486 states have (on average 1.0926527221928566) internal successors, (28940), 26486 states have internal predecessors, (28940), 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-16 14:12:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26487 states to 26487 states and 28940 transitions. [2025-03-16 14:12:12,227 INFO L78 Accepts]: Start accepts. Automaton has 26487 states and 28940 transitions. Word has length 278 [2025-03-16 14:12:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:12,228 INFO L471 AbstractCegarLoop]: Abstraction has 26487 states and 28940 transitions. [2025-03-16 14:12:12,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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-16 14:12:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 26487 states and 28940 transitions. [2025-03-16 14:12:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-16 14:12:12,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:12,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:12:12,243 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1390486800, now seen corresponding path program 1 times [2025-03-16 14:12:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246970234] [2025-03-16 14:12:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:12,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 14:12:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 14:12:12,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:12,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 94 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2025-03-16 14:12:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246970234] [2025-03-16 14:12:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246970234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353244348] [2025-03-16 14:12:12,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:12,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:12,555 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-16 14:12:12,556 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-16 14:12:12,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-16 14:12:12,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-16 14:12:12,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:12,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:12,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:12,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-16 14:12:12,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:12,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353244348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:12,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:12,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:12,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268014589] [2025-03-16 14:12:12,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:12,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:12,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:12,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:12,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:12,807 INFO L87 Difference]: Start difference. First operand 26487 states and 28940 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-16 14:12:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:13,305 INFO L93 Difference]: Finished difference Result 64369 states and 70619 transitions. [2025-03-16 14:12:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:13,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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 293 [2025-03-16 14:12:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:13,349 INFO L225 Difference]: With dead ends: 64369 [2025-03-16 14:12:13,349 INFO L226 Difference]: Without dead ends: 37883 [2025-03-16 14:12:13,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:13,372 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 46 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:13,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 354 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37883 states. [2025-03-16 14:12:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37883 to 36231. [2025-03-16 14:12:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36231 states, 36230 states have (on average 1.095169748826939) internal successors, (39678), 36230 states have internal predecessors, (39678), 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-16 14:12:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36231 states to 36231 states and 39678 transitions. [2025-03-16 14:12:13,832 INFO L78 Accepts]: Start accepts. Automaton has 36231 states and 39678 transitions. Word has length 293 [2025-03-16 14:12:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:13,832 INFO L471 AbstractCegarLoop]: Abstraction has 36231 states and 39678 transitions. [2025-03-16 14:12:13,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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-16 14:12:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 36231 states and 39678 transitions. [2025-03-16 14:12:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-03-16 14:12:13,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:13,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:13,882 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-16 14:12:14,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 14:12:14,076 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:14,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 597675285, now seen corresponding path program 1 times [2025-03-16 14:12:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:14,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304434339] [2025-03-16 14:12:14,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:14,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-03-16 14:12:14,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-03-16 14:12:14,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:14,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:14,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:14,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304434339] [2025-03-16 14:12:14,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304434339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:14,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:14,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138261185] [2025-03-16 14:12:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:14,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:14,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:14,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:14,257 INFO L87 Difference]: Start difference. First operand 36231 states and 39678 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-16 14:12:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:14,819 INFO L93 Difference]: Finished difference Result 70836 states and 77527 transitions. [2025-03-16 14:12:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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 308 [2025-03-16 14:12:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:14,859 INFO L225 Difference]: With dead ends: 70836 [2025-03-16 14:12:14,859 INFO L226 Difference]: Without dead ends: 34606 [2025-03-16 14:12:14,883 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-16 14:12:14,884 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 211 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:14,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 299 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:14,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34606 states. [2025-03-16 14:12:15,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34606 to 31556. [2025-03-16 14:12:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31556 states, 31555 states have (on average 1.0778323562034542) internal successors, (34011), 31555 states have internal predecessors, (34011), 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-16 14:12:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31556 states to 31556 states and 34011 transitions. [2025-03-16 14:12:15,166 INFO L78 Accepts]: Start accepts. Automaton has 31556 states and 34011 transitions. Word has length 308 [2025-03-16 14:12:15,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:15,166 INFO L471 AbstractCegarLoop]: Abstraction has 31556 states and 34011 transitions. [2025-03-16 14:12:15,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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-16 14:12:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 31556 states and 34011 transitions. [2025-03-16 14:12:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 14:12:15,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:15,188 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:15,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:12:15,188 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:15,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:15,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2001067484, now seen corresponding path program 1 times [2025-03-16 14:12:15,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:15,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788882627] [2025-03-16 14:12:15,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:15,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:15,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 14:12:15,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 14:12:15,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:15,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 141 proven. 6 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 14:12:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788882627] [2025-03-16 14:12:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788882627] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205192314] [2025-03-16 14:12:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:15,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:15,568 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-16 14:12:15,569 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-16 14:12:15,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 14:12:15,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 14:12:15,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:15,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:15,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:15,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-16 14:12:15,808 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205192314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:15,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:15,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:12:15,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950671727] [2025-03-16 14:12:15,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:15,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:15,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:15,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:15,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:15,810 INFO L87 Difference]: Start difference. First operand 31556 states and 34011 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 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-16 14:12:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:16,090 INFO L93 Difference]: Finished difference Result 93223 states and 100467 transitions. [2025-03-16 14:12:16,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:16,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 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 344 [2025-03-16 14:12:16,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:16,159 INFO L225 Difference]: With dead ends: 93223 [2025-03-16 14:12:16,159 INFO L226 Difference]: Without dead ends: 61668 [2025-03-16 14:12:16,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:16,190 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 228 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:16,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 482 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 14:12:16,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61668 states. [2025-03-16 14:12:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61668 to 61668. [2025-03-16 14:12:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61668 states, 61667 states have (on average 1.0771076913097768) internal successors, (66422), 61667 states have internal predecessors, (66422), 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-16 14:12:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61668 states to 61668 states and 66422 transitions. [2025-03-16 14:12:16,811 INFO L78 Accepts]: Start accepts. Automaton has 61668 states and 66422 transitions. Word has length 344 [2025-03-16 14:12:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:16,812 INFO L471 AbstractCegarLoop]: Abstraction has 61668 states and 66422 transitions. [2025-03-16 14:12:16,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 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-16 14:12:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 61668 states and 66422 transitions. [2025-03-16 14:12:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-16 14:12:16,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:16,849 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:16,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:17,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 14:12:17,049 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:17,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash 522599869, now seen corresponding path program 1 times [2025-03-16 14:12:17,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:17,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639383339] [2025-03-16 14:12:17,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:17,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-16 14:12:17,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-16 14:12:17,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:17,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 289 proven. 62 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:12:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639383339] [2025-03-16 14:12:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639383339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296857346] [2025-03-16 14:12:17,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:17,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:17,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:17,560 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-16 14:12:17,562 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-16 14:12:17,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-16 14:12:17,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-16 14:12:17,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:17,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:17,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:17,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-16 14:12:17,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:17,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296857346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:17,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:17,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:17,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218794698] [2025-03-16 14:12:17,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:17,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:17,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:17,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:17,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:17,800 INFO L87 Difference]: Start difference. First operand 61668 states and 66422 transitions. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-16 14:12:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:18,441 INFO L93 Difference]: Finished difference Result 138570 states and 149778 transitions. [2025-03-16 14:12:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 426 [2025-03-16 14:12:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:18,521 INFO L225 Difference]: With dead ends: 138570 [2025-03-16 14:12:18,521 INFO L226 Difference]: Without dead ends: 76903 [2025-03-16 14:12:18,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:18,561 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 158 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:18,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 113 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76903 states. [2025-03-16 14:12:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76903 to 74863. [2025-03-16 14:12:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74863 states, 74862 states have (on average 1.0653201891480324) internal successors, (79752), 74862 states have internal predecessors, (79752), 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-16 14:12:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74863 states to 74863 states and 79752 transitions. [2025-03-16 14:12:19,705 INFO L78 Accepts]: Start accepts. Automaton has 74863 states and 79752 transitions. Word has length 426 [2025-03-16 14:12:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:19,706 INFO L471 AbstractCegarLoop]: Abstraction has 74863 states and 79752 transitions. [2025-03-16 14:12:19,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-16 14:12:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 74863 states and 79752 transitions. [2025-03-16 14:12:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-16 14:12:19,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:19,772 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:19,779 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-16 14:12:19,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:19,973 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:19,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:19,973 INFO L85 PathProgramCache]: Analyzing trace with hash 72861666, now seen corresponding path program 1 times [2025-03-16 14:12:19,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:19,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600931269] [2025-03-16 14:12:19,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:19,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:20,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 14:12:20,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 14:12:20,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:20,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 337 proven. 6 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-03-16 14:12:20,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:20,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600931269] [2025-03-16 14:12:20,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600931269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:20,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951978059] [2025-03-16 14:12:20,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:20,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:20,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:20,688 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-16 14:12:20,690 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-16 14:12:20,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-16 14:12:20,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-16 14:12:20,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:20,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:20,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:20,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:20,974 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-03-16 14:12:20,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:20,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951978059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:20,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192296464] [2025-03-16 14:12:20,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:20,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:20,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:20,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:20,977 INFO L87 Difference]: Start difference. First operand 74863 states and 79752 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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-16 14:12:21,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:21,692 INFO L93 Difference]: Finished difference Result 201578 states and 215111 transitions. [2025-03-16 14:12:21,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:21,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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 506 [2025-03-16 14:12:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:21,832 INFO L225 Difference]: With dead ends: 201578 [2025-03-16 14:12:21,832 INFO L226 Difference]: Without dead ends: 126716 [2025-03-16 14:12:21,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 505 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:21,868 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 205 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:21,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 729 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:12:21,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126716 states. [2025-03-16 14:12:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126716 to 121030. [2025-03-16 14:12:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121030 states, 121029 states have (on average 1.0600847730709169) internal successors, (128301), 121029 states have internal predecessors, (128301), 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-16 14:12:23,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121030 states to 121030 states and 128301 transitions. [2025-03-16 14:12:23,515 INFO L78 Accepts]: Start accepts. Automaton has 121030 states and 128301 transitions. Word has length 506 [2025-03-16 14:12:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:23,520 INFO L471 AbstractCegarLoop]: Abstraction has 121030 states and 128301 transitions. [2025-03-16 14:12:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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-16 14:12:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 121030 states and 128301 transitions. [2025-03-16 14:12:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-16 14:12:23,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:23,590 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:23,597 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-16 14:12:23,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:23,791 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:23,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash 412318551, now seen corresponding path program 1 times [2025-03-16 14:12:23,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:23,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243038089] [2025-03-16 14:12:23,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:23,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:23,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 14:12:23,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 14:12:23,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:23,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 360 proven. 6 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2025-03-16 14:12:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243038089] [2025-03-16 14:12:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243038089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839990169] [2025-03-16 14:12:24,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:24,474 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-16 14:12:24,475 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-16 14:12:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-16 14:12:24,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-16 14:12:24,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:24,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 14:12:24,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839990169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736084411] [2025-03-16 14:12:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:24,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:24,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:24,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:24,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:24,955 INFO L87 Difference]: Start difference. First operand 121030 states and 128301 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-16 14:12:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:25,768 INFO L93 Difference]: Finished difference Result 241259 states and 255776 transitions. [2025-03-16 14:12:25,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:25,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 527 [2025-03-16 14:12:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:25,771 INFO L225 Difference]: With dead ends: 241259 [2025-03-16 14:12:25,771 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:12:25,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:25,851 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:25,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 272 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:12:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:12:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:12:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:12:25,853 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 527 [2025-03-16 14:12:25,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:25,853 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:12:25,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-16 14:12:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:12:25,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:12:25,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:12:25,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 14:12:26,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:26,059 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:26,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:12:34,504 WARN L286 SmtUtils]: Spent 8.44s on a formula simplification. DAG size of input: 587 DAG size of output: 548 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-16 14:12:38,782 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:12:38,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:12:38 BoogieIcfgContainer [2025-03-16 14:12:38,808 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:12:38,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:12:38,809 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:12:38,809 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:12:38,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:55" (3/4) ... [2025-03-16 14:12:38,813 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:12:38,836 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:12:38,838 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:12:38,839 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:12:38,840 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:12:38,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:12:38,978 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:12:38,978 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:12:38,981 INFO L158 Benchmark]: Toolchain (without parser) took 45902.43ms. Allocated memory was 142.6MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 96.8MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2025-03-16 14:12:38,981 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:12:38,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.71ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 37.2MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-16 14:12:38,981 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.52ms. Allocated memory is still 142.6MB. Free memory was 37.2MB in the beginning and 89.7MB in the end (delta: -52.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2025-03-16 14:12:38,981 INFO L158 Benchmark]: Boogie Preprocessor took 106.81ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 79.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:12:38,982 INFO L158 Benchmark]: IcfgBuilder took 1444.73ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.2MB in the beginning and 228.0MB in the end (delta: -148.8MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. [2025-03-16 14:12:38,982 INFO L158 Benchmark]: TraceAbstraction took 43448.28ms. Allocated memory was 343.9MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 228.0MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. [2025-03-16 14:12:38,982 INFO L158 Benchmark]: Witness Printer took 169.82ms. Allocated memory is still 5.6GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:12:38,983 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.71ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 37.2MB in the end (delta: 59.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.52ms. Allocated memory is still 142.6MB. Free memory was 37.2MB in the beginning and 89.7MB in the end (delta: -52.5MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.81ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 79.2MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1444.73ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 79.2MB in the beginning and 228.0MB in the end (delta: -148.8MB). Peak memory consumption was 56.9MB. Max. memory is 16.1GB. * TraceAbstraction took 43448.28ms. Allocated memory was 343.9MB in the beginning and 5.6GB in the end (delta: 5.2GB). Free memory was 228.0MB in the beginning and 4.0GB in the end (delta: -3.8GB). Peak memory consumption was 3.9GB. Max. memory is 16.1GB. * Witness Printer took 169.82ms. Allocated memory is still 5.6GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1594]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 241 locations, 457 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.7s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2932 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2932 mSDsluCounter, 4770 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 1558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10310 IncrementalHoareTripleChecker+Invalid, 11868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1558 mSolverCounterUnsat, 4025 mSDtfsCounter, 10310 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3058 GetRequests, 3017 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121030occurred in iteration=19, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 14131 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 8468 NumberOfCodeBlocks, 8468 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 8439 ConstructedInterpolants, 0 QuantifiedInterpolants, 29176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 5184 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 5395/5505 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Location Invariant Derived location invariant: ((((((((((((((((((((((((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0)) || ((((((((a26 == 1) && (a5 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a11 == 1)) && (a23 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a23 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a11 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a11 == 1)) && (a6 == 1)) && (a16 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a23 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a3 <= 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || ((((((a5 == 1) && (a6 == 1)) && (a11 <= 0)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (2 <= a3)) && (a11 == 1)) && (a12 <= 0)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a11 <= 0)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1)) && (a6 <= 0))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || ((((((((a15 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a6 == 1)) && (a11 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 == 1)) && (a12 <= 0)) && (a27 == 1)) && (a18 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a11 == 1)) && (a18 == 1)) && (a27 <= 0)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:12:39,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE