./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label33.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label33.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 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:51:44,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:51:44,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:51:44,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:51:44,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:51:44,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:51:44,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:51:44,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:51:44,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:51:44,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:51:44,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:51:44,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:51:44,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:51:44,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:51:44,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:51:44,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:51:44,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:51:44,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:51:44,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:51:44,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:51:44,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:51:44,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:51:44,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:51:44,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:51:44,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:51:44,276 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 -> 2175eebe64ea8c44232439b071a8f90dfd26c4ea62c7d488d233e915c25d2276 [2025-03-03 09:51:44,503 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:51:44,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:51:44,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:51:44,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:51:44,515 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:51:44,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2025-03-03 09:51:45,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b5e2ea/a036cdc90ea440c4b43bc428f07beb67/FLAGb6d323a0c [2025-03-03 09:51:46,074 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:51:46,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label33.c [2025-03-03 09:51:46,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b5e2ea/a036cdc90ea440c4b43bc428f07beb67/FLAGb6d323a0c [2025-03-03 09:51:46,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b2b5e2ea/a036cdc90ea440c4b43bc428f07beb67 [2025-03-03 09:51:46,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:51:46,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:51:46,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:51:46,118 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:51:46,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:51:46,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4277dd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46, skipping insertion in model container [2025-03-03 09:51:46,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,161 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:51:46,539 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_label33.c[55678,55691] [2025-03-03 09:51:46,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:51:46,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:51:46,710 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_label33.c[55678,55691] [2025-03-03 09:51:46,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:51:46,742 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:51:46,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46 WrapperNode [2025-03-03 09:51:46,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:51:46,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:51:46,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:51:46,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:51:46,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,846 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:51:46,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:51:46,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:51:46,848 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:51:46,848 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:51:46,854 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,902 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 09:51:46,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,939 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:46,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:47,004 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:51:47,006 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:51:47,006 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:51:47,006 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:51:47,007 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (1/1) ... [2025-03-03 09:51:47,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:51:47,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:47,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:51:47,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:51:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:51:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:51:47,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:51:47,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:51:47,125 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:51:47,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:51:48,577 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:51:48,577 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:51:48,587 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:51:48,587 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:51:48,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:51:48 BoogieIcfgContainer [2025-03-03 09:51:48,587 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:51:48,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:51:48,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:51:48,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:51:48,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:51:46" (1/3) ... [2025-03-03 09:51:48,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c1033c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:51:48, skipping insertion in model container [2025-03-03 09:51:48,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:51:46" (2/3) ... [2025-03-03 09:51:48,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c1033c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:51:48, skipping insertion in model container [2025-03-03 09:51:48,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:51:48" (3/3) ... [2025-03-03 09:51:48,596 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label33.c [2025-03-03 09:51:48,610 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:51:48,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label33.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:51:48,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:51:48,671 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;@382a6a86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:51:48,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:51:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:48,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 09:51:48,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:48,688 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] [2025-03-03 09:51:48,689 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:48,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:48,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1080797294, now seen corresponding path program 1 times [2025-03-03 09:51:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556932930] [2025-03-03 09:51:48,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:48,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:48,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 09:51:48,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 09:51:48,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:48,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556932930] [2025-03-03 09:51:49,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556932930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:49,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700476496] [2025-03-03 09:51:49,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:49,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:49,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:49,435 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:50,278 INFO L93 Difference]: Finished difference Result 857 states and 1495 transitions. [2025-03-03 09:51:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:50,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 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 159 [2025-03-03 09:51:50,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:50,287 INFO L225 Difference]: With dead ends: 857 [2025-03-03 09:51:50,287 INFO L226 Difference]: Without dead ends: 462 [2025-03-03 09:51:50,290 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-03 09:51:50,292 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 129 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:50,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 187 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:51:50,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-03-03 09:51:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2025-03-03 09:51:50,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 1.5381263616557734) internal successors, (706), 459 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 706 transitions. [2025-03-03 09:51:50,337 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 706 transitions. Word has length 159 [2025-03-03 09:51:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 706 transitions. [2025-03-03 09:51:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 2 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 706 transitions. [2025-03-03 09:51:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 09:51:50,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:50,340 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] [2025-03-03 09:51:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:51:50,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1941546628, now seen corresponding path program 1 times [2025-03-03 09:51:50,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:50,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989133264] [2025-03-03 09:51:50,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:50,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 09:51:50,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 09:51:50,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:50,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:50,523 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-03 09:51:50,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989133264] [2025-03-03 09:51:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989133264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:50,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970686365] [2025-03-03 09:51:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:50,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:50,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:50,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:50,526 INFO L87 Difference]: Start difference. First operand 460 states and 706 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:51,205 INFO L93 Difference]: Finished difference Result 1344 states and 2079 transitions. [2025-03-03 09:51:51,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:51,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 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 167 [2025-03-03 09:51:51,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:51,209 INFO L225 Difference]: With dead ends: 1344 [2025-03-03 09:51:51,209 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 09:51:51,211 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-03 09:51:51,211 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 93 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-03 09:51:51,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 93 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 09:51:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 870. [2025-03-03 09:51:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.5120828538550057) internal successors, (1314), 869 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-03 09:51:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1314 transitions. [2025-03-03 09:51:51,237 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1314 transitions. Word has length 167 [2025-03-03 09:51:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1314 transitions. [2025-03-03 09:51:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1314 transitions. [2025-03-03 09:51:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-03 09:51:51,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:51,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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-03 09:51:51,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:51:51,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:51,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:51,245 INFO L85 PathProgramCache]: Analyzing trace with hash -473580285, now seen corresponding path program 1 times [2025-03-03 09:51:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762114912] [2025-03-03 09:51:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:51,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 09:51:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 09:51:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:51:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762114912] [2025-03-03 09:51:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762114912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392723957] [2025-03-03 09:51:51,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:51,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:51,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:51,555 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:51,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:51:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-03 09:51:51,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-03 09:51:51,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:51,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:51,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:51,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:51:51,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392723957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:51,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:51,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 09:51:51,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133757972] [2025-03-03 09:51:51,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:51,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:51,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:51,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:51,736 INFO L87 Difference]: Start difference. First operand 870 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:51,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:51,973 INFO L93 Difference]: Finished difference Result 2601 states and 3933 transitions. [2025-03-03 09:51:51,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:51,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 179 [2025-03-03 09:51:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:51,980 INFO L225 Difference]: With dead ends: 2601 [2025-03-03 09:51:51,980 INFO L226 Difference]: Without dead ends: 1733 [2025-03-03 09:51:51,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 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-03 09:51:51,982 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 360 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:51,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:51:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1733 states. [2025-03-03 09:51:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1733 to 1729. [2025-03-03 09:51:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1729 states, 1728 states have (on average 1.5127314814814814) internal successors, (2614), 1728 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1729 states to 1729 states and 2614 transitions. [2025-03-03 09:51:52,025 INFO L78 Accepts]: Start accepts. Automaton has 1729 states and 2614 transitions. Word has length 179 [2025-03-03 09:51:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:52,026 INFO L471 AbstractCegarLoop]: Abstraction has 1729 states and 2614 transitions. [2025-03-03 09:51:52,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1729 states and 2614 transitions. [2025-03-03 09:51:52,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-03 09:51:52,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:52,029 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-03 09:51:52,038 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-03 09:51:52,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:52,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:52,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:52,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1283624696, now seen corresponding path program 1 times [2025-03-03 09:51:52,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:52,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207643948] [2025-03-03 09:51:52,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:52,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:52,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 09:51:52,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 09:51:52,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:52,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207643948] [2025-03-03 09:51:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207643948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319809898] [2025-03-03 09:51:52,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:52,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:52,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:52,508 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:52,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:51:52,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-03 09:51:52,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-03 09:51:52,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:52,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:52,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:52,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:52,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:52,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319809898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:52,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:52,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:51:52,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432860868] [2025-03-03 09:51:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:52,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:52,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:52,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:52,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:52,660 INFO L87 Difference]: Start difference. First operand 1729 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:53,369 INFO L93 Difference]: Finished difference Result 5088 states and 7710 transitions. [2025-03-03 09:51:53,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:53,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 181 [2025-03-03 09:51:53,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:53,378 INFO L225 Difference]: With dead ends: 5088 [2025-03-03 09:51:53,379 INFO L226 Difference]: Without dead ends: 3361 [2025-03-03 09:51:53,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:53,382 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 230 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:53,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 416 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:51:53,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2025-03-03 09:51:53,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3357. [2025-03-03 09:51:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3356 states have (on average 1.33611442193087) internal successors, (4484), 3356 states have internal predecessors, (4484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 4484 transitions. [2025-03-03 09:51:53,456 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 4484 transitions. Word has length 181 [2025-03-03 09:51:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:53,457 INFO L471 AbstractCegarLoop]: Abstraction has 3357 states and 4484 transitions. [2025-03-03 09:51:53,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 4484 transitions. [2025-03-03 09:51:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 09:51:53,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:53,461 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] [2025-03-03 09:51:53,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:51:53,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:51:53,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:53,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 109924375, now seen corresponding path program 1 times [2025-03-03 09:51:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:53,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895032748] [2025-03-03 09:51:53,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 09:51:53,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 09:51:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:53,816 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-03 09:51:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895032748] [2025-03-03 09:51:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895032748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:53,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832290432] [2025-03-03 09:51:53,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:53,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:53,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:53,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:53,818 INFO L87 Difference]: Start difference. First operand 3357 states and 4484 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-03 09:51:54,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:54,474 INFO L93 Difference]: Finished difference Result 9983 states and 13341 transitions. [2025-03-03 09:51:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:54,475 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-03 09:51:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:54,493 INFO L225 Difference]: With dead ends: 9983 [2025-03-03 09:51:54,494 INFO L226 Difference]: Without dead ends: 6628 [2025-03-03 09:51:54,498 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-03 09:51:54,499 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 239 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:54,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 173 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6628 states. [2025-03-03 09:51:54,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6628 to 6626. [2025-03-03 09:51:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6626 states, 6625 states have (on average 1.2840754716981133) internal successors, (8507), 6625 states have internal predecessors, (8507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6626 states to 6626 states and 8507 transitions. [2025-03-03 09:51:54,609 INFO L78 Accepts]: Start accepts. Automaton has 6626 states and 8507 transitions. Word has length 182 [2025-03-03 09:51:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 6626 states and 8507 transitions. [2025-03-03 09:51:54,609 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-03 09:51:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 6626 states and 8507 transitions. [2025-03-03 09:51:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-03 09:51:54,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:54,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2025-03-03 09:51:54,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:51:54,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:54,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:54,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1591271286, now seen corresponding path program 1 times [2025-03-03 09:51:54,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:54,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38913239] [2025-03-03 09:51:54,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:54,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:54,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-03 09:51:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-03 09:51:54,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:54,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:54,760 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:51:54,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:54,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38913239] [2025-03-03 09:51:54,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38913239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:54,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:54,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000309582] [2025-03-03 09:51:54,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:54,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:54,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:54,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:54,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:54,762 INFO L87 Difference]: Start difference. First operand 6626 states and 8507 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-03 09:51:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:55,132 INFO L93 Difference]: Finished difference Result 13186 states and 16926 transitions. [2025-03-03 09:51:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:55,132 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 194 [2025-03-03 09:51:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:55,152 INFO L225 Difference]: With dead ends: 13186 [2025-03-03 09:51:55,152 INFO L226 Difference]: Without dead ends: 6562 [2025-03-03 09:51:55,159 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-03 09:51:55,160 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:55,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:51:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2025-03-03 09:51:55,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6562. [2025-03-03 09:51:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6562 states, 6561 states have (on average 1.2554488645023625) internal successors, (8237), 6561 states have internal predecessors, (8237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:55,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6562 states to 6562 states and 8237 transitions. [2025-03-03 09:51:55,283 INFO L78 Accepts]: Start accepts. Automaton has 6562 states and 8237 transitions. Word has length 194 [2025-03-03 09:51:55,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:55,283 INFO L471 AbstractCegarLoop]: Abstraction has 6562 states and 8237 transitions. [2025-03-03 09:51:55,283 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-03 09:51:55,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6562 states and 8237 transitions. [2025-03-03 09:51:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 09:51:55,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:55,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:51:55,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:51:55,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:55,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:55,292 INFO L85 PathProgramCache]: Analyzing trace with hash 492246695, now seen corresponding path program 1 times [2025-03-03 09:51:55,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:55,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498203045] [2025-03-03 09:51:55,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:55,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:55,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 09:51:55,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 09:51:55,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:55,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:55,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:55,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498203045] [2025-03-03 09:51:55,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498203045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:51:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:51:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384476536] [2025-03-03 09:51:55,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:55,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:55,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:55,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:55,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:51:55,529 INFO L87 Difference]: Start difference. First operand 6562 states and 8237 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:56,193 INFO L93 Difference]: Finished difference Result 16394 states and 20520 transitions. [2025-03-03 09:51:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:56,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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 200 [2025-03-03 09:51:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:56,221 INFO L225 Difference]: With dead ends: 16394 [2025-03-03 09:51:56,222 INFO L226 Difference]: Without dead ends: 9834 [2025-03-03 09:51:56,228 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-03 09:51:56,229 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 196 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:56,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 106 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:56,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9834 states. [2025-03-03 09:51:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9834 to 9832. [2025-03-03 09:51:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9832 states, 9831 states have (on average 1.2394466483572373) internal successors, (12185), 9831 states have internal predecessors, (12185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:56,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9832 states to 9832 states and 12185 transitions. [2025-03-03 09:51:56,407 INFO L78 Accepts]: Start accepts. Automaton has 9832 states and 12185 transitions. Word has length 200 [2025-03-03 09:51:56,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:56,407 INFO L471 AbstractCegarLoop]: Abstraction has 9832 states and 12185 transitions. [2025-03-03 09:51:56,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:56,408 INFO L276 IsEmpty]: Start isEmpty. Operand 9832 states and 12185 transitions. [2025-03-03 09:51:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 09:51:56,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:56,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:51:56,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:51:56,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:56,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:56,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1229373292, now seen corresponding path program 1 times [2025-03-03 09:51:56,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:56,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772261753] [2025-03-03 09:51:56,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:56,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 09:51:56,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 09:51:56,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:51:56,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772261753] [2025-03-03 09:51:56,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772261753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:56,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486124018] [2025-03-03 09:51:56,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:56,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:56,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:56,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:56,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:51:56,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 09:51:56,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 09:51:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:56,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:56,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:57,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486124018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:57,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:51:57,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301011052] [2025-03-03 09:51:57,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:57,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:57,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:57,056 INFO L87 Difference]: Start difference. First operand 9832 states and 12185 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:57,723 INFO L93 Difference]: Finished difference Result 29446 states and 36504 transitions. [2025-03-03 09:51:57,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:57,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 207 [2025-03-03 09:51:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:57,764 INFO L225 Difference]: With dead ends: 29446 [2025-03-03 09:51:57,764 INFO L226 Difference]: Without dead ends: 19616 [2025-03-03 09:51:57,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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-03 09:51:57,780 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 72 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:57,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 117 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:51:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19616 states. [2025-03-03 09:51:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19616 to 15934. [2025-03-03 09:51:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15934 states, 15933 states have (on average 1.2679972384359506) internal successors, (20203), 15933 states have internal predecessors, (20203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:58,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15934 states to 15934 states and 20203 transitions. [2025-03-03 09:51:58,123 INFO L78 Accepts]: Start accepts. Automaton has 15934 states and 20203 transitions. Word has length 207 [2025-03-03 09:51:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:51:58,123 INFO L471 AbstractCegarLoop]: Abstraction has 15934 states and 20203 transitions. [2025-03-03 09:51:58,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15934 states and 20203 transitions. [2025-03-03 09:51:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 09:51:58,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:51:58,139 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-03-03 09:51:58,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:51:58,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:58,340 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:51:58,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:51:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1494641613, now seen corresponding path program 1 times [2025-03-03 09:51:58,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:51:58,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454818069] [2025-03-03 09:51:58,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:51:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 09:51:58,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 09:51:58,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:58,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 09:51:58,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:51:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454818069] [2025-03-03 09:51:58,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454818069] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:51:58,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087246989] [2025-03-03 09:51:58,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:51:58,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:51:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:51:58,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:51:58,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:51:58,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 09:51:58,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 09:51:58,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:51:58,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:51:58,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:51:58,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:51:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:51:58,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:51:58,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087246989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:51:58,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:51:58,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:51:58,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600631008] [2025-03-03 09:51:58,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:51:58,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:51:58,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:51:58,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:51:58,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:58,888 INFO L87 Difference]: Start difference. First operand 15934 states and 20203 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:51:59,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:51:59,530 INFO L93 Difference]: Finished difference Result 41210 states and 53322 transitions. [2025-03-03 09:51:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:51:59,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 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-03 09:51:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:51:59,641 INFO L225 Difference]: With dead ends: 41210 [2025-03-03 09:51:59,641 INFO L226 Difference]: Without dead ends: 25278 [2025-03-03 09:51:59,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:51:59,655 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 205 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:51:59,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 135 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:51:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25278 states. [2025-03-03 09:51:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25278 to 25272. [2025-03-03 09:51:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25272 states, 25271 states have (on average 1.2151082268212576) internal successors, (30707), 25271 states have internal predecessors, (30707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25272 states to 25272 states and 30707 transitions. [2025-03-03 09:52:00,014 INFO L78 Accepts]: Start accepts. Automaton has 25272 states and 30707 transitions. Word has length 226 [2025-03-03 09:52:00,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:00,014 INFO L471 AbstractCegarLoop]: Abstraction has 25272 states and 30707 transitions. [2025-03-03 09:52:00,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:00,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25272 states and 30707 transitions. [2025-03-03 09:52:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 09:52:00,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:00,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:52:00,044 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-03 09:52:00,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:00,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:00,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1038474990, now seen corresponding path program 1 times [2025-03-03 09:52:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:00,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593048116] [2025-03-03 09:52:00,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:00,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 09:52:00,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 09:52:00,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:52:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593048116] [2025-03-03 09:52:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593048116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389385600] [2025-03-03 09:52:01,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:01,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:01,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:01,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:01,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:52:01,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 09:52:01,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 09:52:01,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:01,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:01,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:01,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:52:01,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389385600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:52:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285583906] [2025-03-03 09:52:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:01,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:01,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:01,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:01,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:01,477 INFO L87 Difference]: Start difference. First operand 25272 states and 30707 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:02,243 INFO L93 Difference]: Finished difference Result 72334 states and 87900 transitions. [2025-03-03 09:52:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 246 [2025-03-03 09:52:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:02,322 INFO L225 Difference]: With dead ends: 72334 [2025-03-03 09:52:02,323 INFO L226 Difference]: Without dead ends: 47064 [2025-03-03 09:52:02,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:02,350 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 97 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:02,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 100 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:02,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47064 states. [2025-03-03 09:52:02,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47064 to 47054. [2025-03-03 09:52:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47054 states, 47053 states have (on average 1.1927188489575584) internal successors, (56121), 47053 states have internal predecessors, (56121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47054 states to 47054 states and 56121 transitions. [2025-03-03 09:52:03,023 INFO L78 Accepts]: Start accepts. Automaton has 47054 states and 56121 transitions. Word has length 246 [2025-03-03 09:52:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:03,024 INFO L471 AbstractCegarLoop]: Abstraction has 47054 states and 56121 transitions. [2025-03-03 09:52:03,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:03,024 INFO L276 IsEmpty]: Start isEmpty. Operand 47054 states and 56121 transitions. [2025-03-03 09:52:03,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 09:52:03,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:03,064 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:52:03,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:52:03,267 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,SelfDestructingSolverStorable9 [2025-03-03 09:52:03,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:03,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:03,269 INFO L85 PathProgramCache]: Analyzing trace with hash -168248353, now seen corresponding path program 1 times [2025-03-03 09:52:03,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:03,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227595612] [2025-03-03 09:52:03,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:03,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:03,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 09:52:03,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 09:52:03,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:03,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227595612] [2025-03-03 09:52:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227595612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:03,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:03,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:52:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826925412] [2025-03-03 09:52:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:03,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:03,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:03,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:03,410 INFO L87 Difference]: Start difference. First operand 47054 states and 56121 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-03 09:52:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:04,258 INFO L93 Difference]: Finished difference Result 86560 states and 103352 transitions. [2025-03-03 09:52:04,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:04,258 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-03 09:52:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:04,329 INFO L225 Difference]: With dead ends: 86560 [2025-03-03 09:52:04,330 INFO L226 Difference]: Without dead ends: 39508 [2025-03-03 09:52:04,361 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-03 09:52:04,363 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 229 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:04,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 342 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39508 states. [2025-03-03 09:52:04,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39508 to 39498. [2025-03-03 09:52:04,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39498 states, 39497 states have (on average 1.16581006152366) internal successors, (46046), 39497 states have internal predecessors, (46046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39498 states to 39498 states and 46046 transitions. [2025-03-03 09:52:05,029 INFO L78 Accepts]: Start accepts. Automaton has 39498 states and 46046 transitions. Word has length 278 [2025-03-03 09:52:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:05,030 INFO L471 AbstractCegarLoop]: Abstraction has 39498 states and 46046 transitions. [2025-03-03 09:52:05,030 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-03 09:52:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39498 states and 46046 transitions. [2025-03-03 09:52:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-03 09:52:05,154 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:05,154 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:52:05,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:52:05,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1190242726, now seen corresponding path program 1 times [2025-03-03 09:52:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659822457] [2025-03-03 09:52:05,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:05,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-03 09:52:05,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-03 09:52:05,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:05,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 09:52:05,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:05,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659822457] [2025-03-03 09:52:05,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659822457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:05,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:05,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:52:05,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553467671] [2025-03-03 09:52:05,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:05,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:52:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:05,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:52:05,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:52:05,417 INFO L87 Difference]: Start difference. First operand 39498 states and 46046 transitions. Second operand has 4 states, 4 states have (on average 54.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-03 09:52:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:06,733 INFO L93 Difference]: Finished difference Result 146149 states and 169860 transitions. [2025-03-03 09:52:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:52:06,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.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 301 [2025-03-03 09:52:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:06,857 INFO L225 Difference]: With dead ends: 146149 [2025-03-03 09:52:06,857 INFO L226 Difference]: Without dead ends: 106653 [2025-03-03 09:52:06,880 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-03 09:52:06,881 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 540 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:06,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 272 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:52:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106653 states. [2025-03-03 09:52:07,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106653 to 106629. [2025-03-03 09:52:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106629 states, 106628 states have (on average 1.1591889559965487) internal successors, (123602), 106628 states have internal predecessors, (123602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106629 states to 106629 states and 123602 transitions. [2025-03-03 09:52:08,208 INFO L78 Accepts]: Start accepts. Automaton has 106629 states and 123602 transitions. Word has length 301 [2025-03-03 09:52:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 106629 states and 123602 transitions. [2025-03-03 09:52:08,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.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-03 09:52:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 106629 states and 123602 transitions. [2025-03-03 09:52:08,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-03 09:52:08,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:08,240 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:52:08,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:52:08,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:08,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1403651127, now seen corresponding path program 1 times [2025-03-03 09:52:08,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:08,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118761737] [2025-03-03 09:52:08,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:08,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:08,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-03 09:52:08,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-03 09:52:08,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:08,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 09:52:08,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:08,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118761737] [2025-03-03 09:52:08,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118761737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:08,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:08,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:08,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474877047] [2025-03-03 09:52:08,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:08,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:08,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:08,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:08,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:08,810 INFO L87 Difference]: Start difference. First operand 106629 states and 123602 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:10,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:10,143 INFO L93 Difference]: Finished difference Result 248659 states and 287842 transitions. [2025-03-03 09:52:10,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:10,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 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 304 [2025-03-03 09:52:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:10,326 INFO L225 Difference]: With dead ends: 248659 [2025-03-03 09:52:10,327 INFO L226 Difference]: Without dead ends: 142032 [2025-03-03 09:52:10,371 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-03 09:52:10,371 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 160 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:10,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 172 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142032 states. [2025-03-03 09:52:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142032 to 142012. [2025-03-03 09:52:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142012 states, 142011 states have (on average 1.1516150157382175) internal successors, (163542), 142011 states have internal predecessors, (163542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:12,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142012 states to 142012 states and 163542 transitions. [2025-03-03 09:52:12,057 INFO L78 Accepts]: Start accepts. Automaton has 142012 states and 163542 transitions. Word has length 304 [2025-03-03 09:52:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:12,057 INFO L471 AbstractCegarLoop]: Abstraction has 142012 states and 163542 transitions. [2025-03-03 09:52:12,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 2 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 142012 states and 163542 transitions. [2025-03-03 09:52:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-03 09:52:12,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:12,088 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 09:52:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 09:52:12,088 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1080159346, now seen corresponding path program 2 times [2025-03-03 09:52:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921036227] [2025-03-03 09:52:12,089 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:52:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:12,122 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 311 statements into 2 equivalence classes. [2025-03-03 09:52:12,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 09:52:12,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:52:12,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 151 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 09:52:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921036227] [2025-03-03 09:52:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921036227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190809155] [2025-03-03 09:52:12,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:52:12,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:12,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:12,888 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:12,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:52:12,976 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 311 statements into 2 equivalence classes. [2025-03-03 09:52:13,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 311 of 311 statements. [2025-03-03 09:52:13,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:52:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:13,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:52:13,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-03-03 09:52:13,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:13,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190809155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:13,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:13,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:52:13,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119383881] [2025-03-03 09:52:13,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:13,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:13,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:13,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:13,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:52:13,338 INFO L87 Difference]: Start difference. First operand 142012 states and 163542 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-03 09:52:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:14,591 INFO L93 Difference]: Finished difference Result 331536 states and 380531 transitions. [2025-03-03 09:52:14,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:14,591 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 311 [2025-03-03 09:52:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:14,594 INFO L225 Difference]: With dead ends: 331536 [2025-03-03 09:52:14,594 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 09:52:14,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 310 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-03 09:52:14,725 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 153 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:14,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 142 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 09:52:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 09:52:14,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 09:52:14,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2025-03-03 09:52:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:14,727 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 09:52:14,727 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-03 09:52:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 09:52:14,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 09:52:14,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 09:52:14,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:52:14,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:14,932 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:14,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 09:52:30,537 WARN L286 SmtUtils]: Spent 15.60s on a formula simplification. DAG size of input: 785 DAG size of output: 819 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 09:52:39,418 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 819 DAG size of output: 36 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-03 09:52:39,422 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 09:52:39,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:52:39 BoogieIcfgContainer [2025-03-03 09:52:39,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 09:52:39,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 09:52:39,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 09:52:39,440 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 09:52:39,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:51:48" (3/4) ... [2025-03-03 09:52:39,443 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 09:52:39,468 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 09:52:39,470 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 09:52:39,471 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 09:52:39,473 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 09:52:39,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 09:52:39,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 09:52:39,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 09:52:39,613 INFO L158 Benchmark]: Toolchain (without parser) took 53499.99ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 127.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-03-03 09:52:39,613 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 09:52:39,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.98ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 68.9MB in the end (delta: 58.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 09:52:39,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.66ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 54.3MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 09:52:39,614 INFO L158 Benchmark]: Boogie Preprocessor took 157.22ms. Allocated memory is still 167.8MB. Free memory was 54.3MB in the beginning and 119.1MB in the end (delta: -64.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2025-03-03 09:52:39,614 INFO L158 Benchmark]: IcfgBuilder took 1581.99ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 101.4MB in the end (delta: 17.7MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2025-03-03 09:52:39,615 INFO L158 Benchmark]: TraceAbstraction took 50850.61ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 100.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2025-03-03 09:52:39,615 INFO L158 Benchmark]: Witness Printer took 172.06ms. Allocated memory is still 5.6GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 09:52:39,616 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.28ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.98ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 68.9MB in the end (delta: 58.3MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.66ms. Allocated memory is still 167.8MB. Free memory was 68.9MB in the beginning and 54.3MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.22ms. Allocated memory is still 167.8MB. Free memory was 54.3MB in the beginning and 119.1MB in the end (delta: -64.9MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * IcfgBuilder took 1581.99ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 101.4MB in the end (delta: 17.7MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * TraceAbstraction took 50850.61ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 100.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 172.06ms. Allocated memory is still 5.6GB. Free memory was 2.1GB in the beginning and 2.0GB in the end (delta: 25.2MB). 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: 1522]: 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, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3178 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3178 mSDsluCounter, 2887 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 1418 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7941 IncrementalHoareTripleChecker+Invalid, 9359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1418 mSolverCounterUnsat, 2113 mSDtfsCounter, 7941 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1382 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142012occurred in iteration=13, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 3782 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 4485 NumberOfCodeBlocks, 4485 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4465 ConstructedInterpolants, 0 QuantifiedInterpolants, 9904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2776 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 20 InterpolantComputations, 14 PerfectInterpolantSequences, 1831/1877 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: (((((((((((a5 == 1) && (a12 == 1)) && (a3 <= 1)) && (a26 <= 0)) || ((a5 == 1) && (a12 <= 0))) || (((a5 == 1) && (a12 == 1)) && (a27 == 1))) || (((a5 == 1) && (a12 == 1)) && (a11 <= 0))) || (((a5 == 1) && (a12 == 1)) && (a3 <= 0))) || (((a5 == 1) && (a12 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (a6 != 1)) && (a11 != 1))) || (((((a5 == 1) && (a12 == 1)) && (a10 == 1)) && (a7 != 1)) && (a26 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-03-03 09:52:39,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE