./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label14.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 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:00:05,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:00:05,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:00:05,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:00:05,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:00:05,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:00:05,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:00:05,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:00:05,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:00:05,285 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:00:05,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:00:05,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:00:05,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:00:05,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:00:05,285 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:00:05,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:00:05,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:00:05,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:00:05,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:00:05,287 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:00:05,287 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 -> 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 [2025-03-16 15:00:05,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:00:05,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:00:05,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:00:05,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:00:05,503 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:00:05,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2025-03-16 15:00:06,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3d5f227/b487a0441cb94753b8d682b6588a206a/FLAGcc93cb891 [2025-03-16 15:00:07,047 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:00:07,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2025-03-16 15:00:07,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3d5f227/b487a0441cb94753b8d682b6588a206a/FLAGcc93cb891 [2025-03-16 15:00:07,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc3d5f227/b487a0441cb94753b8d682b6588a206a [2025-03-16 15:00:07,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:00:07,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:00:07,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:00:07,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:00:07,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:00:07,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:00:07" (1/1) ... [2025-03-16 15:00:07,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0aaf31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:07, skipping insertion in model container [2025-03-16 15:00:07,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:00:07" (1/1) ... [2025-03-16 15:00:07,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:00:07,396 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/Problem13_label14.c[5911,5924] [2025-03-16 15:00:07,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:00:07,922 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:00:07,938 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/Problem13_label14.c[5911,5924] [2025-03-16 15:00:08,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:00:08,254 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:00:08,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08 WrapperNode [2025-03-16 15:00:08,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:00:08,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:00:08,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:00:08,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:00:08,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,640 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:00:08,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:00:08,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:00:08,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:00:08,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:00:08,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:00:08,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:08,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,086 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,139 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:00:09,250 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:00:09,251 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:00:09,251 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:00:09,252 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (1/1) ... [2025-03-16 15:00:09,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:00:09,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:09,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:00:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:00:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:00:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:00:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:00:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:00:09,343 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:00:09,344 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:00:13,234 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:00:13,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:00:13,236 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:00:13,402 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:00:13,403 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:00:13,434 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:00:13,434 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:00:13,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:00:13 BoogieIcfgContainer [2025-03-16 15:00:13,435 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:00:13,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:00:13,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:00:13,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:00:13,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:00:07" (1/3) ... [2025-03-16 15:00:13,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d63a4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:00:13, skipping insertion in model container [2025-03-16 15:00:13,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:00:08" (2/3) ... [2025-03-16 15:00:13,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d63a4f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:00:13, skipping insertion in model container [2025-03-16 15:00:13,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:00:13" (3/3) ... [2025-03-16 15:00:13,442 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label14.c [2025-03-16 15:00:13,453 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:00:13,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label14.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:00:13,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:00:13,542 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;@2c773da3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:00:13,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:00:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:00:13,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:13,557 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] [2025-03-16 15:00:13,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:13,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:13,562 INFO L85 PathProgramCache]: Analyzing trace with hash 14459574, now seen corresponding path program 1 times [2025-03-16 15:00:13,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501882586] [2025-03-16 15:00:13,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:13,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:13,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:00:13,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:00:13,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:13,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501882586] [2025-03-16 15:00:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501882586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886270308] [2025-03-16 15:00:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:00:13,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:13,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:00:13,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:00:13,726 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:13,816 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:00:13,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:00:13,817 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 15:00:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:13,828 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:00:13,829 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:00:13,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:00:13,840 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:13,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:00:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:00:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:00:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:13,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:00:13,920 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 40 [2025-03-16 15:00:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:00:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:00:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 15:00:13,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:13,922 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] [2025-03-16 15:00:13,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:00:13,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:13,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1792266153, now seen corresponding path program 1 times [2025-03-16 15:00:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:13,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857053013] [2025-03-16 15:00:13,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:13,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:13,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 15:00:13,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 15:00:13,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:13,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857053013] [2025-03-16 15:00:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857053013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:14,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090938205] [2025-03-16 15:00:14,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:14,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:14,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:14,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:14,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:14,119 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:17,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:17,461 INFO L93 Difference]: Finished difference Result 2931 states and 5350 transitions. [2025-03-16 15:00:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:17,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2025-03-16 15:00:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:17,469 INFO L225 Difference]: With dead ends: 2931 [2025-03-16 15:00:17,469 INFO L226 Difference]: Without dead ends: 1898 [2025-03-16 15:00:17,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:17,471 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 974 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 3434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:17,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 600 Invalid, 3434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 2874 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-16 15:00:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-16 15:00:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1893. [2025-03-16 15:00:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1892 states have (on average 1.73784355179704) internal successors, (3288), 1892 states have internal predecessors, (3288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 3288 transitions. [2025-03-16 15:00:17,522 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 3288 transitions. Word has length 40 [2025-03-16 15:00:17,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:17,522 INFO L471 AbstractCegarLoop]: Abstraction has 1893 states and 3288 transitions. [2025-03-16 15:00:17,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:17,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 3288 transitions. [2025-03-16 15:00:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 15:00:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:17,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:00:17,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash -609486106, now seen corresponding path program 1 times [2025-03-16 15:00:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145982882] [2025-03-16 15:00:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:17,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 15:00:17,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 15:00:17,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:17,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:17,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:17,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145982882] [2025-03-16 15:00:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145982882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516012606] [2025-03-16 15:00:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:17,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:17,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:17,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:17,854 INFO L87 Difference]: Start difference. First operand 1893 states and 3288 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:20,890 INFO L93 Difference]: Finished difference Result 5436 states and 9565 transitions. [2025-03-16 15:00:20,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:20,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2025-03-16 15:00:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:20,903 INFO L225 Difference]: With dead ends: 5436 [2025-03-16 15:00:20,903 INFO L226 Difference]: Without dead ends: 3544 [2025-03-16 15:00:20,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:20,909 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3127 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 3127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:20,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 880 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 3127 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 15:00:20,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-16 15:00:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3483. [2025-03-16 15:00:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3483 states, 3482 states have (on average 1.586731763354394) internal successors, (5525), 3482 states have internal predecessors, (5525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3483 states to 3483 states and 5525 transitions. [2025-03-16 15:00:20,969 INFO L78 Accepts]: Start accepts. Automaton has 3483 states and 5525 transitions. Word has length 105 [2025-03-16 15:00:20,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:20,969 INFO L471 AbstractCegarLoop]: Abstraction has 3483 states and 5525 transitions. [2025-03-16 15:00:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3483 states and 5525 transitions. [2025-03-16 15:00:20,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 15:00:20,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:20,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:20,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:00:20,971 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:20,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -124508624, now seen corresponding path program 1 times [2025-03-16 15:00:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:20,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589790377] [2025-03-16 15:00:20,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:20,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 15:00:20,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 15:00:20,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:20,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:21,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:21,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589790377] [2025-03-16 15:00:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589790377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:21,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:21,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063424414] [2025-03-16 15:00:21,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:21,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:21,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:21,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:21,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:21,133 INFO L87 Difference]: Start difference. First operand 3483 states and 5525 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:23,650 INFO L93 Difference]: Finished difference Result 10137 states and 16133 transitions. [2025-03-16 15:00:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:23,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-16 15:00:23,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:23,668 INFO L225 Difference]: With dead ends: 10137 [2025-03-16 15:00:23,668 INFO L226 Difference]: Without dead ends: 6655 [2025-03-16 15:00:23,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:23,672 INFO L435 NwaCegarLoop]: 982 mSDtfsCounter, 871 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:23,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1135 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:00:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6655 states. [2025-03-16 15:00:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6655 to 6654. [2025-03-16 15:00:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6654 states, 6653 states have (on average 1.4172553735157072) internal successors, (9429), 6653 states have internal predecessors, (9429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6654 states to 6654 states and 9429 transitions. [2025-03-16 15:00:23,757 INFO L78 Accepts]: Start accepts. Automaton has 6654 states and 9429 transitions. Word has length 106 [2025-03-16 15:00:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:23,759 INFO L471 AbstractCegarLoop]: Abstraction has 6654 states and 9429 transitions. [2025-03-16 15:00:23,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 6654 states and 9429 transitions. [2025-03-16 15:00:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 15:00:23,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:23,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:23,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:00:23,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 855473840, now seen corresponding path program 1 times [2025-03-16 15:00:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71576459] [2025-03-16 15:00:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:23,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 15:00:23,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 15:00:23,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:23,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:23,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:23,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71576459] [2025-03-16 15:00:23,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71576459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:23,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818088263] [2025-03-16 15:00:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:23,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:23,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:23,871 INFO L87 Difference]: Start difference. First operand 6654 states and 9429 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:26,695 INFO L93 Difference]: Finished difference Result 14119 states and 20672 transitions. [2025-03-16 15:00:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 15:00:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:26,712 INFO L225 Difference]: With dead ends: 14119 [2025-03-16 15:00:26,712 INFO L226 Difference]: Without dead ends: 7466 [2025-03-16 15:00:26,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:26,718 INFO L435 NwaCegarLoop]: 1042 mSDtfsCounter, 872 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2662 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:26,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1175 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2662 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:00:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7466 states. [2025-03-16 15:00:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7466 to 7455. [2025-03-16 15:00:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3390126106788303) internal successors, (9981), 7454 states have internal predecessors, (9981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9981 transitions. [2025-03-16 15:00:26,815 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9981 transitions. Word has length 109 [2025-03-16 15:00:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9981 transitions. [2025-03-16 15:00:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9981 transitions. [2025-03-16 15:00:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 15:00:26,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:26,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:00:26,817 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2105065695, now seen corresponding path program 1 times [2025-03-16 15:00:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87282074] [2025-03-16 15:00:26,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:26,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 15:00:26,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 15:00:26,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:26,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:27,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:27,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87282074] [2025-03-16 15:00:27,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87282074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:27,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:00:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432406925] [2025-03-16 15:00:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:27,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:27,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:27,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:27,085 INFO L87 Difference]: Start difference. First operand 7455 states and 9981 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:29,311 INFO L93 Difference]: Finished difference Result 14122 states and 19149 transitions. [2025-03-16 15:00:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2025-03-16 15:00:29,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:29,327 INFO L225 Difference]: With dead ends: 14122 [2025-03-16 15:00:29,327 INFO L226 Difference]: Without dead ends: 7455 [2025-03-16 15:00:29,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:29,333 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 678 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2523 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 2542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:29,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1214 Invalid, 2542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2523 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:29,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7455 states. [2025-03-16 15:00:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7455 to 7455. [2025-03-16 15:00:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 7454 states have (on average 1.3363294875234772) internal successors, (9961), 7454 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 9961 transitions. [2025-03-16 15:00:29,473 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 9961 transitions. Word has length 151 [2025-03-16 15:00:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:29,474 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 9961 transitions. [2025-03-16 15:00:29,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 9961 transitions. [2025-03-16 15:00:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-16 15:00:29,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:29,476 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:29,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:00:29,476 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash -481336437, now seen corresponding path program 1 times [2025-03-16 15:00:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:29,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777988268] [2025-03-16 15:00:29,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:29,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:29,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-16 15:00:29,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-16 15:00:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:29,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777988268] [2025-03-16 15:00:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777988268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532003410] [2025-03-16 15:00:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:29,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:00:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:29,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:00:29,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:29,659 INFO L87 Difference]: Start difference. First operand 7455 states and 9961 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:35,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:35,175 INFO L93 Difference]: Finished difference Result 26115 states and 35958 transitions. [2025-03-16 15:00:35,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:00:35,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2025-03-16 15:00:35,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:35,212 INFO L225 Difference]: With dead ends: 26115 [2025-03-16 15:00:35,212 INFO L226 Difference]: Without dead ends: 19448 [2025-03-16 15:00:35,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:35,224 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1651 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6046 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 6710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 6046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:35,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 999 Invalid, 6710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 6046 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-16 15:00:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19448 states. [2025-03-16 15:00:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19448 to 19302. [2025-03-16 15:00:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19302 states, 19301 states have (on average 1.2778612507123983) internal successors, (24664), 19301 states have internal predecessors, (24664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19302 states to 19302 states and 24664 transitions. [2025-03-16 15:00:35,501 INFO L78 Accepts]: Start accepts. Automaton has 19302 states and 24664 transitions. Word has length 165 [2025-03-16 15:00:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:35,501 INFO L471 AbstractCegarLoop]: Abstraction has 19302 states and 24664 transitions. [2025-03-16 15:00:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 19302 states and 24664 transitions. [2025-03-16 15:00:35,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 15:00:35,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:35,504 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:35,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:00:35,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:35,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash 969054230, now seen corresponding path program 1 times [2025-03-16 15:00:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:35,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113882097] [2025-03-16 15:00:35,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:35,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 15:00:35,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 15:00:35,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:35,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113882097] [2025-03-16 15:00:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113882097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:35,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:35,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691907292] [2025-03-16 15:00:35,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:35,697 INFO L87 Difference]: Start difference. First operand 19302 states and 24664 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:38,424 INFO L93 Difference]: Finished difference Result 52019 states and 67593 transitions. [2025-03-16 15:00:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 252 [2025-03-16 15:00:38,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:38,474 INFO L225 Difference]: With dead ends: 52019 [2025-03-16 15:00:38,475 INFO L226 Difference]: Without dead ends: 33505 [2025-03-16 15:00:38,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:38,494 INFO L435 NwaCegarLoop]: 1838 mSDtfsCounter, 760 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:38,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1980 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33505 states. [2025-03-16 15:00:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33505 to 33476. [2025-03-16 15:00:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33476 states, 33475 states have (on average 1.200537714712472) internal successors, (40188), 33475 states have internal predecessors, (40188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33476 states to 33476 states and 40188 transitions. [2025-03-16 15:00:38,938 INFO L78 Accepts]: Start accepts. Automaton has 33476 states and 40188 transitions. Word has length 252 [2025-03-16 15:00:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 33476 states and 40188 transitions. [2025-03-16 15:00:38,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:38,940 INFO L276 IsEmpty]: Start isEmpty. Operand 33476 states and 40188 transitions. [2025-03-16 15:00:38,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-16 15:00:38,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:38,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:00:38,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash 271724820, now seen corresponding path program 1 times [2025-03-16 15:00:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345673513] [2025-03-16 15:00:38,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:38,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-16 15:00:38,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-16 15:00:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:38,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:39,055 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:00:39,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:39,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345673513] [2025-03-16 15:00:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345673513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:39,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:39,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:39,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171596633] [2025-03-16 15:00:39,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:39,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:39,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:39,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:39,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:39,056 INFO L87 Difference]: Start difference. First operand 33476 states and 40188 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:41,863 INFO L93 Difference]: Finished difference Result 89762 states and 108791 transitions. [2025-03-16 15:00:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-03-16 15:00:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:41,936 INFO L225 Difference]: With dead ends: 89762 [2025-03-16 15:00:41,936 INFO L226 Difference]: Without dead ends: 54709 [2025-03-16 15:00:41,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:41,968 INFO L435 NwaCegarLoop]: 1758 mSDtfsCounter, 887 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 3242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:41,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1896 Invalid, 3242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:00:42,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54709 states. [2025-03-16 15:00:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54709 to 52340. [2025-03-16 15:00:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52340 states, 52339 states have (on average 1.1679244922524312) internal successors, (61128), 52339 states have internal predecessors, (61128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52340 states to 52340 states and 61128 transitions. [2025-03-16 15:00:42,569 INFO L78 Accepts]: Start accepts. Automaton has 52340 states and 61128 transitions. Word has length 254 [2025-03-16 15:00:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:42,570 INFO L471 AbstractCegarLoop]: Abstraction has 52340 states and 61128 transitions. [2025-03-16 15:00:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 52340 states and 61128 transitions. [2025-03-16 15:00:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-16 15:00:42,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:42,575 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:00:42,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:42,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:42,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1745731506, now seen corresponding path program 1 times [2025-03-16 15:00:42,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:42,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214960265] [2025-03-16 15:00:42,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:42,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-16 15:00:42,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-16 15:00:42,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:42,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 309 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:00:42,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:42,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214960265] [2025-03-16 15:00:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214960265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847361830] [2025-03-16 15:00:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:42,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:00:42,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:42,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:00:42,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:42,761 INFO L87 Difference]: Start difference. First operand 52340 states and 61128 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:47,807 INFO L93 Difference]: Finished difference Result 140313 states and 165850 transitions. [2025-03-16 15:00:47,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:00:47,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 306 [2025-03-16 15:00:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:47,917 INFO L225 Difference]: With dead ends: 140313 [2025-03-16 15:00:47,917 INFO L226 Difference]: Without dead ends: 88761 [2025-03-16 15:00:47,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:47,953 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 1729 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 6086 mSolverCounterSat, 998 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 7084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 998 IncrementalHoareTripleChecker+Valid, 6086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:47,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1164 Invalid, 7084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [998 Valid, 6086 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:00:48,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88761 states. [2025-03-16 15:00:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88761 to 87054. [2025-03-16 15:00:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87054 states, 87053 states have (on average 1.1674037655221532) internal successors, (101626), 87053 states have internal predecessors, (101626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87054 states to 87054 states and 101626 transitions. [2025-03-16 15:00:49,037 INFO L78 Accepts]: Start accepts. Automaton has 87054 states and 101626 transitions. Word has length 306 [2025-03-16 15:00:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:49,038 INFO L471 AbstractCegarLoop]: Abstraction has 87054 states and 101626 transitions. [2025-03-16 15:00:49,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 87054 states and 101626 transitions. [2025-03-16 15:00:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-16 15:00:49,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:49,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2025-03-16 15:00:49,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:00:49,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:49,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:49,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1891630650, now seen corresponding path program 1 times [2025-03-16 15:00:49,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:49,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202890835] [2025-03-16 15:00:49,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:49,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:49,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 15:00:49,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 15:00:49,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:49,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 52 proven. 50 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 15:00:49,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:49,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202890835] [2025-03-16 15:00:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202890835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:49,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320561967] [2025-03-16 15:00:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:49,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:49,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:00:49,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-16 15:00:49,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-16 15:00:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:49,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:00:49,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 15:00:49,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320561967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:49,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 15:00:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350640322] [2025-03-16 15:00:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:49,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:49,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:49,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:00:49,753 INFO L87 Difference]: Start difference. First operand 87054 states and 101626 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:52,752 INFO L93 Difference]: Finished difference Result 211106 states and 249998 transitions. [2025-03-16 15:00:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:52,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 331 [2025-03-16 15:00:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:52,889 INFO L225 Difference]: With dead ends: 211106 [2025-03-16 15:00:52,889 INFO L226 Difference]: Without dead ends: 124840 [2025-03-16 15:00:52,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:00:52,947 INFO L435 NwaCegarLoop]: 1866 mSDtfsCounter, 802 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:52,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2007 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:00:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124840 states. [2025-03-16 15:00:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124840 to 122469. [2025-03-16 15:00:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122469 states, 122468 states have (on average 1.1389015906195905) internal successors, (139479), 122468 states have internal predecessors, (139479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122469 states to 122469 states and 139479 transitions. [2025-03-16 15:00:54,287 INFO L78 Accepts]: Start accepts. Automaton has 122469 states and 139479 transitions. Word has length 331 [2025-03-16 15:00:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:54,287 INFO L471 AbstractCegarLoop]: Abstraction has 122469 states and 139479 transitions. [2025-03-16 15:00:54,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:54,287 INFO L276 IsEmpty]: Start isEmpty. Operand 122469 states and 139479 transitions. [2025-03-16 15:00:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 15:00:54,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:54,292 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:00:54,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:00:54,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:00:54,492 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:54,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1949936383, now seen corresponding path program 1 times [2025-03-16 15:00:54,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:54,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635276421] [2025-03-16 15:00:54,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:54,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:54,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 15:00:54,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 15:00:54,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:54,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 206 proven. 113 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:00:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:55,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635276421] [2025-03-16 15:00:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635276421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632784760] [2025-03-16 15:00:55,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:55,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:55,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:55,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:55,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 15:00:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 15:00:55,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 15:00:55,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:55,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:55,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:00:55,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:00:55,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:55,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632784760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:55,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:55,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:00:55,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212268655] [2025-03-16 15:00:55,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:55,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:55,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:55,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:55,814 INFO L87 Difference]: Start difference. First operand 122469 states and 139479 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:00:58,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:58,451 INFO L93 Difference]: Finished difference Result 244139 states and 278155 transitions. [2025-03-16 15:00:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:58,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 346 [2025-03-16 15:00:58,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:58,578 INFO L225 Difference]: With dead ends: 244139 [2025-03-16 15:00:58,579 INFO L226 Difference]: Without dead ends: 122458 [2025-03-16 15:00:58,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:00:58,630 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 1074 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:58,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 795 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122458 states. [2025-03-16 15:00:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122458 to 122455. [2025-03-16 15:00:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122455 states, 122454 states have (on average 1.102797785290803) internal successors, (135042), 122454 states have internal predecessors, (135042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122455 states to 122455 states and 135042 transitions. [2025-03-16 15:01:00,111 INFO L78 Accepts]: Start accepts. Automaton has 122455 states and 135042 transitions. Word has length 346 [2025-03-16 15:01:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:00,111 INFO L471 AbstractCegarLoop]: Abstraction has 122455 states and 135042 transitions. [2025-03-16 15:01:00,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 122455 states and 135042 transitions. [2025-03-16 15:01:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-03-16 15:01:00,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:00,115 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:01:00,129 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-16 15:01:00,315 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,SelfDestructingSolverStorable11 [2025-03-16 15:01:00,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:00,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1443263256, now seen corresponding path program 1 times [2025-03-16 15:01:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827996466] [2025-03-16 15:01:00,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:00,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-16 15:01:00,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-16 15:01:00,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 249 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:01:01,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827996466] [2025-03-16 15:01:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827996466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:01:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667137795] [2025-03-16 15:01:01,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:01,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:01:01,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:01:01,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-03-16 15:01:01,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-03-16 15:01:01,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:01,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:01,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:01:01,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:01:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-03-16 15:01:01,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:01:01,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667137795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:01,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:01:01,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:01:01,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489415530] [2025-03-16 15:01:01,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:01,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:01,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:01,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:01,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:01,225 INFO L87 Difference]: Start difference. First operand 122455 states and 135042 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:03,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:03,737 INFO L93 Difference]: Finished difference Result 243332 states and 268312 transitions. [2025-03-16 15:01:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2025-03-16 15:01:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:03,891 INFO L225 Difference]: With dead ends: 243332 [2025-03-16 15:01:03,891 INFO L226 Difference]: Without dead ends: 121665 [2025-03-16 15:01:03,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:03,965 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 1112 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 2894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:03,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 1419 Invalid, 2894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:01:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121665 states. [2025-03-16 15:01:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121665 to 120873. [2025-03-16 15:01:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120873 states, 120872 states have (on average 1.0777020319015156) internal successors, (130264), 120872 states have internal predecessors, (130264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:05,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120873 states to 120873 states and 130264 transitions. [2025-03-16 15:01:05,405 INFO L78 Accepts]: Start accepts. Automaton has 120873 states and 130264 transitions. Word has length 366 [2025-03-16 15:01:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:05,405 INFO L471 AbstractCegarLoop]: Abstraction has 120873 states and 130264 transitions. [2025-03-16 15:01:05,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 120873 states and 130264 transitions. [2025-03-16 15:01:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 15:01:05,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:05,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:05,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:01:05,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:05,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:05,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1545190746, now seen corresponding path program 1 times [2025-03-16 15:01:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920350282] [2025-03-16 15:01:05,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:05,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:01:05,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:01:05,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:05,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 318 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:01:06,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920350282] [2025-03-16 15:01:06,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920350282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:01:06,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528868089] [2025-03-16 15:01:06,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:06,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:06,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:01:06,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:01:06,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:01:06,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:01:06,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:06,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:06,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:01:06,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:01:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-16 15:01:06,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:01:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528868089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:01:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:01:06,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597270212] [2025-03-16 15:01:06,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:06,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:06,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:06,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:06,797 INFO L87 Difference]: Start difference. First operand 120873 states and 130264 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:09,682 INFO L93 Difference]: Finished difference Result 275591 states and 299426 transitions. [2025-03-16 15:01:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 413 [2025-03-16 15:01:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:09,850 INFO L225 Difference]: With dead ends: 275591 [2025-03-16 15:01:09,850 INFO L226 Difference]: Without dead ends: 155506 [2025-03-16 15:01:09,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:09,923 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 962 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 968 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 968 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:09,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 798 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [968 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:01:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155506 states. [2025-03-16 15:01:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155506 to 153124. [2025-03-16 15:01:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153124 states, 153123 states have (on average 1.0818818858042227) internal successors, (165661), 153123 states have internal predecessors, (165661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:11,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153124 states to 153124 states and 165661 transitions. [2025-03-16 15:01:11,523 INFO L78 Accepts]: Start accepts. Automaton has 153124 states and 165661 transitions. Word has length 413 [2025-03-16 15:01:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:11,524 INFO L471 AbstractCegarLoop]: Abstraction has 153124 states and 165661 transitions. [2025-03-16 15:01:11,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 153124 states and 165661 transitions. [2025-03-16 15:01:11,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2025-03-16 15:01:11,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:11,529 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:01:11,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 15:01:11,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:11,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:11,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:11,730 INFO L85 PathProgramCache]: Analyzing trace with hash 979927704, now seen corresponding path program 1 times [2025-03-16 15:01:11,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:11,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885863174] [2025-03-16 15:01:11,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:11,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:11,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 434 statements into 1 equivalence classes. [2025-03-16 15:01:11,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 434 of 434 statements. [2025-03-16 15:01:11,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:11,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:01:12,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:12,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885863174] [2025-03-16 15:01:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885863174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:12,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:01:12,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:01:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069681381] [2025-03-16 15:01:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:12,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:12,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:12,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:12,176 INFO L87 Difference]: Start difference. First operand 153124 states and 165661 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:15,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:15,396 INFO L93 Difference]: Finished difference Result 304683 states and 329582 transitions. [2025-03-16 15:01:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:15,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2025-03-16 15:01:15,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:15,561 INFO L225 Difference]: With dead ends: 304683 [2025-03-16 15:01:15,561 INFO L226 Difference]: Without dead ends: 151560 [2025-03-16 15:01:15,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:01:15,619 INFO L435 NwaCegarLoop]: 1715 mSDtfsCounter, 794 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2500 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 2500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:15,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1856 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 2500 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:01:15,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151560 states. [2025-03-16 15:01:16,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151560 to 149966. [2025-03-16 15:01:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149966 states, 149965 states have (on average 1.0543393458473644) internal successors, (158114), 149965 states have internal predecessors, (158114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149966 states to 149966 states and 158114 transitions. [2025-03-16 15:01:17,149 INFO L78 Accepts]: Start accepts. Automaton has 149966 states and 158114 transitions. Word has length 434 [2025-03-16 15:01:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:17,149 INFO L471 AbstractCegarLoop]: Abstraction has 149966 states and 158114 transitions. [2025-03-16 15:01:17,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 149966 states and 158114 transitions. [2025-03-16 15:01:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 15:01:17,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:17,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:01:17,156 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1827140298, now seen corresponding path program 1 times [2025-03-16 15:01:17,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:17,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874864244] [2025-03-16 15:01:17,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:17,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 15:01:17,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 15:01:17,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:17,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 318 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:01:18,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874864244] [2025-03-16 15:01:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874864244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:01:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508920644] [2025-03-16 15:01:18,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:18,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:18,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:18,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:01:18,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:01:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 15:01:18,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 15:01:18,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:18,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:18,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:01:18,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:01:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:01:18,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:01:18,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508920644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:18,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:01:18,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:01:18,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410494640] [2025-03-16 15:01:18,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:18,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:18,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:18,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:18,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:18,708 INFO L87 Difference]: Start difference. First operand 149966 states and 158114 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:21,764 INFO L93 Difference]: Finished difference Result 325135 states and 344375 transitions. [2025-03-16 15:01:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:21,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 441 [2025-03-16 15:01:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:21,972 INFO L225 Difference]: With dead ends: 325135 [2025-03-16 15:01:21,972 INFO L226 Difference]: Without dead ends: 175957 [2025-03-16 15:01:22,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:01:22,057 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 708 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2447 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:22,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1096 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2447 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:01:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175957 states. [2025-03-16 15:01:23,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175957 to 173571. [2025-03-16 15:01:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173571 states, 173570 states have (on average 1.052272858212825) internal successors, (182643), 173570 states have internal predecessors, (182643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173571 states to 173571 states and 182643 transitions. [2025-03-16 15:01:23,868 INFO L78 Accepts]: Start accepts. Automaton has 173571 states and 182643 transitions. Word has length 441 [2025-03-16 15:01:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:01:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 173571 states and 182643 transitions. [2025-03-16 15:01:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 173571 states and 182643 transitions. [2025-03-16 15:01:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-16 15:01:23,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:01:23,875 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:01:23,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 15:01:24,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:01:24,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:01:24,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:01:24,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1991007131, now seen corresponding path program 1 times [2025-03-16 15:01:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:01:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744530050] [2025-03-16 15:01:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:01:24,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-16 15:01:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-16 15:01:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 315 proven. 113 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 15:01:25,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:01:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744530050] [2025-03-16 15:01:25,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744530050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:01:25,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27499667] [2025-03-16 15:01:25,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:01:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:01:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:01:25,362 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:01:25,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:01:25,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-16 15:01:25,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-16 15:01:25,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:01:25,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:01:25,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:01:25,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:01:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:01:25,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:01:25,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27499667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:01:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:01:25,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:01:25,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576148633] [2025-03-16 15:01:25,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:01:25,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:01:25,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:01:25,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:01:25,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:01:25,621 INFO L87 Difference]: Start difference. First operand 173571 states and 182643 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:01:28,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:01:28,472 INFO L93 Difference]: Finished difference Result 339243 states and 358173 transitions. [2025-03-16 15:01:28,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:01:28,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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 470 [2025-03-16 15:01:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:01:28,924 INFO L225 Difference]: With dead ends: 339243 [2025-03-16 15:01:28,924 INFO L226 Difference]: Without dead ends: 184567 [2025-03-16 15:01:28,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:01:28,985 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1126 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 3041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:01:28,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 362 Invalid, 3041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:01:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184567 states.