./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label45.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 2e210509e505e706510a09c6375318a552974bcae2c812476edd01f44c4d9064 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:44:39,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:44:39,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:44:39,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:44:39,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:44:39,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:44:39,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:44:39,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:44:39,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:44:39,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:44:39,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:44:39,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:44:39,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:44:39,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:44:39,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:44:39,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:44:39,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:44:39,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:44:39,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:39,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:44:39,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:44:39,373 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 -> 2e210509e505e706510a09c6375318a552974bcae2c812476edd01f44c4d9064 [2025-03-03 10:44:39,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:44:39,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:44:39,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:44:39,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:44:39,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:44:39,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label45.c [2025-03-03 10:44:40,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa84fe05/aa1cfbb0b7404bde8f0100d4fcf5c53f/FLAG23256cb07 [2025-03-03 10:44:41,136 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:44:41,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label45.c [2025-03-03 10:44:41,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa84fe05/aa1cfbb0b7404bde8f0100d4fcf5c53f/FLAG23256cb07 [2025-03-03 10:44:41,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afa84fe05/aa1cfbb0b7404bde8f0100d4fcf5c53f [2025-03-03 10:44:41,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:44:41,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:44:41,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:41,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:44:41,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:44:41,333 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:41" (1/1) ... [2025-03-03 10:44:41,334 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:41, skipping insertion in model container [2025-03-03 10:44:41,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:44:41" (1/1) ... [2025-03-03 10:44:41,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:44:41,593 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_label45.c[1393,1406] [2025-03-03 10:44:42,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:42,261 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:44:42,270 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_label45.c[1393,1406] [2025-03-03 10:44:42,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:44:42,592 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:44:42,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42 WrapperNode [2025-03-03 10:44:42,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:44:42,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:42,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:44:42,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:44:42,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:42,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,090 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:44:43,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:44:43,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:44:43,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:44:43,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:44:43,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:44:43,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,523 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,564 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:44:43,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:44:43,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:44:43,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:44:43,670 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (1/1) ... [2025-03-03 10:44:43,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:44:43,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:44:43,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:44:43,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:44:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:44:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:44:43,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:44:43,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:44:43,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:44:43,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:44:48,287 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:44:48,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:44:48,288 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:44:48,431 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:44:48,431 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:44:48,462 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:44:48,463 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:44:48,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:48 BoogieIcfgContainer [2025-03-03 10:44:48,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:44:48,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:44:48,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:44:48,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:44:48,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:44:41" (1/3) ... [2025-03-03 10:44:48,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4329ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:48, skipping insertion in model container [2025-03-03 10:44:48,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:44:42" (2/3) ... [2025-03-03 10:44:48,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4329ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:44:48, skipping insertion in model container [2025-03-03 10:44:48,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:44:48" (3/3) ... [2025-03-03 10:44:48,473 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label45.c [2025-03-03 10:44:48,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:44:48,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label45.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:44:48,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:44:48,572 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;@7c7da367, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:44:48,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:44:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 10:44:48,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:48,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:48,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:48,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 139995337, now seen corresponding path program 1 times [2025-03-03 10:44:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:48,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416109144] [2025-03-03 10:44:48,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:48,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 10:44:48,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 10:44:48,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:48,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:48,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416109144] [2025-03-03 10:44:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416109144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:48,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:48,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460806653] [2025-03-03 10:44:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:48,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:48,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:48,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:48,754 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:51,925 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-03-03 10:44:51,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:51,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-03 10:44:51,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:51,948 INFO L225 Difference]: With dead ends: 3035 [2025-03-03 10:44:51,948 INFO L226 Difference]: Without dead ends: 1873 [2025-03-03 10:44:51,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:51,956 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 898 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:51,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:44:51,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-03 10:44:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-03-03 10:44:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-03-03 10:44:52,052 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 7 [2025-03-03 10:44:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:52,052 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-03-03 10:44:52,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-03-03 10:44:52,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 10:44:52,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:52,054 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:44:52,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:44:52,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:52,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:52,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1894849901, now seen corresponding path program 1 times [2025-03-03 10:44:52,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:52,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896090553] [2025-03-03 10:44:52,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:52,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:52,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 10:44:52,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 10:44:52,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:52,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:52,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896090553] [2025-03-03 10:44:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896090553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:52,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:52,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991228322] [2025-03-03 10:44:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:52,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:52,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:52,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:52,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:52,375 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:55,439 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-03-03 10:44:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 10:44:55,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:55,450 INFO L225 Difference]: With dead ends: 5317 [2025-03-03 10:44:55,451 INFO L226 Difference]: Without dead ends: 3460 [2025-03-03 10:44:55,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:55,455 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:55,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:44:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-03-03 10:44:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-03-03 10:44:55,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-03-03 10:44:55,513 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 79 [2025-03-03 10:44:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:55,514 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-03-03 10:44:55,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-03-03 10:44:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 10:44:55,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:55,515 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:44:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:44:55,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash 211681035, now seen corresponding path program 1 times [2025-03-03 10:44:55,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:55,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881515837] [2025-03-03 10:44:55,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:55,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 10:44:55,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 10:44:55,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:55,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881515837] [2025-03-03 10:44:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881515837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:55,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:44:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997660800] [2025-03-03 10:44:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:55,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:55,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:55,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:55,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:55,662 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:44:59,021 INFO L93 Difference]: Finished difference Result 10097 states and 13940 transitions. [2025-03-03 10:44:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:44:59,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 10:44:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:44:59,048 INFO L225 Difference]: With dead ends: 10097 [2025-03-03 10:44:59,048 INFO L226 Difference]: Without dead ends: 6640 [2025-03-03 10:44:59,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:59,054 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:44:59,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 904 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:44:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-03-03 10:44:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6631. [2025-03-03 10:44:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-03-03 10:44:59,149 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 93 [2025-03-03 10:44:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:44:59,151 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-03-03 10:44:59,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:44:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-03-03 10:44:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 10:44:59,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:44:59,152 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:44:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:44:59,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:44:59,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:44:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 670916723, now seen corresponding path program 1 times [2025-03-03 10:44:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:44:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158928783] [2025-03-03 10:44:59,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:44:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:44:59,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 10:44:59,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 10:44:59,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:44:59,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:44:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:44:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:44:59,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158928783] [2025-03-03 10:44:59,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158928783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:44:59,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:44:59,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:44:59,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064938082] [2025-03-03 10:44:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:44:59,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:44:59,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:44:59,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:44:59,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:44:59,296 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:02,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:02,555 INFO L93 Difference]: Finished difference Result 16421 states and 21400 transitions. [2025-03-03 10:45:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-03 10:45:02,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:02,579 INFO L225 Difference]: With dead ends: 16421 [2025-03-03 10:45:02,579 INFO L226 Difference]: Without dead ends: 9792 [2025-03-03 10:45:02,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:02,586 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 990 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:02,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1690 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 10:45:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-03-03 10:45:02,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 9783. [2025-03-03 10:45:02,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9783 states, 9782 states have (on average 1.275914945818851) internal successors, (12481), 9782 states have internal predecessors, (12481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 12481 transitions. [2025-03-03 10:45:02,719 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 12481 transitions. Word has length 96 [2025-03-03 10:45:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:02,719 INFO L471 AbstractCegarLoop]: Abstraction has 9783 states and 12481 transitions. [2025-03-03 10:45:02,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 12481 transitions. [2025-03-03 10:45:02,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 10:45:02,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:02,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:02,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:45:02,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:02,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:02,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2059577131, now seen corresponding path program 1 times [2025-03-03 10:45:02,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:02,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125034721] [2025-03-03 10:45:02,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:02,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:02,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 10:45:02,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 10:45:02,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:02,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:02,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125034721] [2025-03-03 10:45:03,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125034721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:03,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832121637] [2025-03-03 10:45:03,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:03,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:03,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:03,005 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:03,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:45:03,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 10:45:03,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 10:45:03,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:03,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:03,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:03,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 10:45:03,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832121637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:03,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:45:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768029722] [2025-03-03 10:45:03,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:03,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:03,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:03,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:03,203 INFO L87 Difference]: Start difference. First operand 9783 states and 12481 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:06,083 INFO L93 Difference]: Finished difference Result 29147 states and 37191 transitions. [2025-03-03 10:45:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:06,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 103 [2025-03-03 10:45:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:06,119 INFO L225 Difference]: With dead ends: 29147 [2025-03-03 10:45:06,119 INFO L226 Difference]: Without dead ends: 19366 [2025-03-03 10:45:06,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:45:06,129 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1045 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 3173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:06,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 906 Invalid, 3173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:45:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2025-03-03 10:45:06,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 19349. [2025-03-03 10:45:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19349 states, 19348 states have (on average 1.2199193715112673) internal successors, (23603), 19348 states have internal predecessors, (23603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 23603 transitions. [2025-03-03 10:45:06,404 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 23603 transitions. Word has length 103 [2025-03-03 10:45:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:06,404 INFO L471 AbstractCegarLoop]: Abstraction has 19349 states and 23603 transitions. [2025-03-03 10:45:06,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 23603 transitions. [2025-03-03 10:45:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 10:45:06,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:06,411 INFO L218 NwaCegarLoop]: trace histogram [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, 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-03 10:45:06,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:45:06,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:06,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:06,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:06,620 INFO L85 PathProgramCache]: Analyzing trace with hash 515355778, now seen corresponding path program 1 times [2025-03-03 10:45:06,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:06,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298928780] [2025-03-03 10:45:06,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:06,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:06,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 10:45:06,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 10:45:06,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:06,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:45:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298928780] [2025-03-03 10:45:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298928780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:06,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513023051] [2025-03-03 10:45:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:06,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:06,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:06,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:06,759 INFO L87 Difference]: Start difference. First operand 19349 states and 23603 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:09,362 INFO L93 Difference]: Finished difference Result 38566 states and 47028 transitions. [2025-03-03 10:45:09,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:09,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 10:45:09,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:09,385 INFO L225 Difference]: With dead ends: 38566 [2025-03-03 10:45:09,385 INFO L226 Difference]: Without dead ends: 19219 [2025-03-03 10:45:09,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:09,397 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1023 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:09,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 1648 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:45:09,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19219 states. [2025-03-03 10:45:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19219 to 18429. [2025-03-03 10:45:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18429 states, 18428 states have (on average 1.1535163881050574) internal successors, (21257), 18428 states have internal predecessors, (21257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 21257 transitions. [2025-03-03 10:45:09,565 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 21257 transitions. Word has length 228 [2025-03-03 10:45:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:09,565 INFO L471 AbstractCegarLoop]: Abstraction has 18429 states and 21257 transitions. [2025-03-03 10:45:09,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 3 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 21257 transitions. [2025-03-03 10:45:09,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-03 10:45:09,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:09,569 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:45:09,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:45:09,569 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash 529717422, now seen corresponding path program 1 times [2025-03-03 10:45:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950360168] [2025-03-03 10:45:09,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:09,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-03 10:45:09,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-03 10:45:09,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:09,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:45:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:10,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950360168] [2025-03-03 10:45:10,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950360168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:10,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:10,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:45:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26157410] [2025-03-03 10:45:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:10,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:10,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:10,119 INFO L87 Difference]: Start difference. First operand 18429 states and 21257 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:12,405 INFO L93 Difference]: Finished difference Result 37643 states and 43314 transitions. [2025-03-03 10:45:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 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 240 [2025-03-03 10:45:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:12,428 INFO L225 Difference]: With dead ends: 37643 [2025-03-03 10:45:12,428 INFO L226 Difference]: Without dead ends: 19216 [2025-03-03 10:45:12,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:12,441 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 2496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:12,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1179 Invalid, 2496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:45:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2025-03-03 10:45:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 19216. [2025-03-03 10:45:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19216 states, 19215 states have (on average 1.1474889409315638) internal successors, (22049), 19215 states have internal predecessors, (22049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19216 states to 19216 states and 22049 transitions. [2025-03-03 10:45:12,613 INFO L78 Accepts]: Start accepts. Automaton has 19216 states and 22049 transitions. Word has length 240 [2025-03-03 10:45:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:12,613 INFO L471 AbstractCegarLoop]: Abstraction has 19216 states and 22049 transitions. [2025-03-03 10:45:12,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19216 states and 22049 transitions. [2025-03-03 10:45:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 10:45:12,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:12,616 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:45:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:45:12,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:12,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:12,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1522642192, now seen corresponding path program 1 times [2025-03-03 10:45:12,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:12,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145046538] [2025-03-03 10:45:12,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:12,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 10:45:12,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 10:45:12,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:12,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:45:12,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:12,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145046538] [2025-03-03 10:45:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145046538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:12,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651535744] [2025-03-03 10:45:12,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:12,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:12,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:12,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:12,869 INFO L87 Difference]: Start difference. First operand 19216 states and 22049 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:18,474 INFO L93 Difference]: Finished difference Result 70902 states and 81557 transitions. [2025-03-03 10:45:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 247 [2025-03-03 10:45:18,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:18,532 INFO L225 Difference]: With dead ends: 70902 [2025-03-03 10:45:18,533 INFO L226 Difference]: Without dead ends: 52475 [2025-03-03 10:45:18,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:45:18,599 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1733 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6790 mSolverCounterSat, 1026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 7816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 6790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:18,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 915 Invalid, 7816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1026 Valid, 6790 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-03 10:45:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52475 states. [2025-03-03 10:45:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52475 to 50779. [2025-03-03 10:45:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50779 states, 50778 states have (on average 1.1289337902241128) internal successors, (57325), 50778 states have internal predecessors, (57325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50779 states to 50779 states and 57325 transitions. [2025-03-03 10:45:19,010 INFO L78 Accepts]: Start accepts. Automaton has 50779 states and 57325 transitions. Word has length 247 [2025-03-03 10:45:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:19,010 INFO L471 AbstractCegarLoop]: Abstraction has 50779 states and 57325 transitions. [2025-03-03 10:45:19,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50779 states and 57325 transitions. [2025-03-03 10:45:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-03 10:45:19,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:19,015 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 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] [2025-03-03 10:45:19,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:45:19,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2074948170, now seen corresponding path program 1 times [2025-03-03 10:45:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897917834] [2025-03-03 10:45:19,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:19,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-03 10:45:19,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-03 10:45:19,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:19,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:45:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897917834] [2025-03-03 10:45:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897917834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:19,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323305710] [2025-03-03 10:45:19,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:19,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:19,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:19,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:19,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:19,257 INFO L87 Difference]: Start difference. First operand 50779 states and 57325 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:22,306 INFO L93 Difference]: Finished difference Result 102349 states and 115450 transitions. [2025-03-03 10:45:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:22,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 305 [2025-03-03 10:45:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:22,372 INFO L225 Difference]: With dead ends: 102349 [2025-03-03 10:45:22,372 INFO L226 Difference]: Without dead ends: 52359 [2025-03-03 10:45:22,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:22,395 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 828 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 747 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:22,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 907 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [747 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:45:22,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52359 states. [2025-03-03 10:45:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52359 to 50775. [2025-03-03 10:45:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50775 states, 50774 states have (on average 1.0957576712490644) internal successors, (55636), 50774 states have internal predecessors, (55636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50775 states to 50775 states and 55636 transitions. [2025-03-03 10:45:22,919 INFO L78 Accepts]: Start accepts. Automaton has 50775 states and 55636 transitions. Word has length 305 [2025-03-03 10:45:22,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:22,919 INFO L471 AbstractCegarLoop]: Abstraction has 50775 states and 55636 transitions. [2025-03-03 10:45:22,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 50775 states and 55636 transitions. [2025-03-03 10:45:22,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-03 10:45:22,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:22,926 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:45:22,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:45:22,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:22,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2140227106, now seen corresponding path program 1 times [2025-03-03 10:45:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908125685] [2025-03-03 10:45:22,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:22,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 10:45:22,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 10:45:22,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:22,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 226 proven. 5 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2025-03-03 10:45:24,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908125685] [2025-03-03 10:45:24,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908125685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853593834] [2025-03-03 10:45:24,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:24,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:24,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:24,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:24,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:45:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-03 10:45:24,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-03 10:45:24,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:24,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:24,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:45:24,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 383 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:45:24,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853593834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:45:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448001303] [2025-03-03 10:45:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:45:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:24,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:45:24,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:45:24,985 INFO L87 Difference]: Start difference. First operand 50775 states and 55636 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:29,709 INFO L93 Difference]: Finished difference Result 130843 states and 143457 transitions. [2025-03-03 10:45:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:45:29,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 336 [2025-03-03 10:45:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:29,783 INFO L225 Difference]: With dead ends: 130843 [2025-03-03 10:45:29,783 INFO L226 Difference]: Without dead ends: 80857 [2025-03-03 10:45:29,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:45:29,797 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1691 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5877 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 6657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 5877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:29,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 785 Invalid, 6657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 5877 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 10:45:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80857 states. [2025-03-03 10:45:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80857 to 79960. [2025-03-03 10:45:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79960 states, 79959 states have (on average 1.0947735714553708) internal successors, (87537), 79959 states have internal predecessors, (87537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79960 states to 79960 states and 87537 transitions. [2025-03-03 10:45:30,637 INFO L78 Accepts]: Start accepts. Automaton has 79960 states and 87537 transitions. Word has length 336 [2025-03-03 10:45:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:30,637 INFO L471 AbstractCegarLoop]: Abstraction has 79960 states and 87537 transitions. [2025-03-03 10:45:30,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 79960 states and 87537 transitions. [2025-03-03 10:45:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-03 10:45:30,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:30,652 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 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-03 10:45:30,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:45:30,853 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,SelfDestructingSolverStorable9 [2025-03-03 10:45:30,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:30,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:30,856 INFO L85 PathProgramCache]: Analyzing trace with hash -433444996, now seen corresponding path program 1 times [2025-03-03 10:45:30,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:30,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180746081] [2025-03-03 10:45:30,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:30,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:30,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-03 10:45:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-03 10:45:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:31,227 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:45:31,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180746081] [2025-03-03 10:45:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180746081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:31,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338970796] [2025-03-03 10:45:31,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:31,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:31,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:31,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:31,232 INFO L87 Difference]: Start difference. First operand 79960 states and 87537 transitions. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:33,863 INFO L93 Difference]: Finished difference Result 160741 states and 175919 transitions. [2025-03-03 10:45:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 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 340 [2025-03-03 10:45:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:33,939 INFO L225 Difference]: With dead ends: 160741 [2025-03-03 10:45:33,939 INFO L226 Difference]: Without dead ends: 79994 [2025-03-03 10:45:33,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:33,982 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 720 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:33,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1906 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:45:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79994 states. [2025-03-03 10:45:34,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79994 to 79168. [2025-03-03 10:45:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79168 states, 79167 states have (on average 1.0838859625854207) internal successors, (85808), 79167 states have internal predecessors, (85808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:34,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79168 states to 79168 states and 85808 transitions. [2025-03-03 10:45:34,891 INFO L78 Accepts]: Start accepts. Automaton has 79168 states and 85808 transitions. Word has length 340 [2025-03-03 10:45:34,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:34,891 INFO L471 AbstractCegarLoop]: Abstraction has 79168 states and 85808 transitions. [2025-03-03 10:45:34,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:34,891 INFO L276 IsEmpty]: Start isEmpty. Operand 79168 states and 85808 transitions. [2025-03-03 10:45:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-03 10:45:34,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:34,895 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:45:34,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:45:34,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:34,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:34,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1653614971, now seen corresponding path program 1 times [2025-03-03 10:45:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621560577] [2025-03-03 10:45:34,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:34,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-03 10:45:34,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-03 10:45:34,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:34,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:45:35,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:35,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621560577] [2025-03-03 10:45:35,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621560577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:35,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:45:35,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:45:35,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979107031] [2025-03-03 10:45:35,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:35,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:35,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:35,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:35,496 INFO L87 Difference]: Start difference. First operand 79168 states and 85808 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:38,743 INFO L93 Difference]: Finished difference Result 182738 states and 199272 transitions. [2025-03-03 10:45:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 369 [2025-03-03 10:45:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:39,030 INFO L225 Difference]: With dead ends: 182738 [2025-03-03 10:45:39,030 INFO L226 Difference]: Without dead ends: 104359 [2025-03-03 10:45:39,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:45:39,064 INFO L435 NwaCegarLoop]: 1757 mSDtfsCounter, 791 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 2997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:39,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1897 Invalid, 2997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:45:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104359 states. [2025-03-03 10:45:39,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104359 to 99624. [2025-03-03 10:45:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99624 states, 99623 states have (on average 1.0789677082601408) internal successors, (107490), 99623 states have internal predecessors, (107490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99624 states to 99624 states and 107490 transitions. [2025-03-03 10:45:39,995 INFO L78 Accepts]: Start accepts. Automaton has 99624 states and 107490 transitions. Word has length 369 [2025-03-03 10:45:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:39,995 INFO L471 AbstractCegarLoop]: Abstraction has 99624 states and 107490 transitions. [2025-03-03 10:45:39,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 99624 states and 107490 transitions. [2025-03-03 10:45:39,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-03 10:45:39,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:39,999 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 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] [2025-03-03 10:45:39,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:45:39,999 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:39,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:39,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1039235433, now seen corresponding path program 1 times [2025-03-03 10:45:39,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:39,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204549795] [2025-03-03 10:45:40,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:40,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:40,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-03 10:45:40,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-03 10:45:40,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:40,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 330 proven. 110 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:45:40,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204549795] [2025-03-03 10:45:40,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204549795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624340673] [2025-03-03 10:45:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:40,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:40,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:40,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:40,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:45:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-03 10:45:40,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-03 10:45:40,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:40,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:41,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:41,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 521 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 10:45:41,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624340673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:41,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:41,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139878297] [2025-03-03 10:45:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:41,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:41,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:41,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:41,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:41,084 INFO L87 Difference]: Start difference. First operand 99624 states and 107490 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-03 10:45:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:44,342 INFO L93 Difference]: Finished difference Result 231514 states and 251126 transitions. [2025-03-03 10:45:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:44,343 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 408 [2025-03-03 10:45:44,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:44,494 INFO L225 Difference]: With dead ends: 231514 [2025-03-03 10:45:44,494 INFO L226 Difference]: Without dead ends: 131891 [2025-03-03 10:45:44,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:44,555 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 968 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:44,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 802 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:45:44,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131891 states. [2025-03-03 10:45:45,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131891 to 94885. [2025-03-03 10:45:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94885 states, 94884 states have (on average 1.0770309008895071) internal successors, (102193), 94884 states have internal predecessors, (102193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94885 states to 94885 states and 102193 transitions. [2025-03-03 10:45:45,823 INFO L78 Accepts]: Start accepts. Automaton has 94885 states and 102193 transitions. Word has length 408 [2025-03-03 10:45:45,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:45,823 INFO L471 AbstractCegarLoop]: Abstraction has 94885 states and 102193 transitions. [2025-03-03 10:45:45,823 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-03 10:45:45,823 INFO L276 IsEmpty]: Start isEmpty. Operand 94885 states and 102193 transitions. [2025-03-03 10:45:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-03 10:45:45,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:45,829 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:45,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:45:46,030 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-03 10:45:46,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -229701036, now seen corresponding path program 1 times [2025-03-03 10:45:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984390802] [2025-03-03 10:45:46,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:46,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:46,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-03 10:45:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-03 10:45:46,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:46,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 380 proven. 110 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-03 10:45:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984390802] [2025-03-03 10:45:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984390802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133520698] [2025-03-03 10:45:47,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:47,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:47,155 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:47,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:45:47,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-03 10:45:47,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-03 10:45:47,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:47,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:47,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:45:47,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:47,425 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 10:45:47,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133520698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:47,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261019333] [2025-03-03 10:45:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:47,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:47,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:47,428 INFO L87 Difference]: Start difference. First operand 94885 states and 102193 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:50,165 INFO L93 Difference]: Finished difference Result 185823 states and 200156 transitions. [2025-03-03 10:45:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:50,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 435 [2025-03-03 10:45:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:50,274 INFO L225 Difference]: With dead ends: 185823 [2025-03-03 10:45:50,274 INFO L226 Difference]: Without dead ends: 91727 [2025-03-03 10:45:50,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:50,322 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 1093 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 2899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:50,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1410 Invalid, 2899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:45:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91727 states. [2025-03-03 10:45:51,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91727 to 91726. [2025-03-03 10:45:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91726 states, 91725 states have (on average 1.0610738620877624) internal successors, (97327), 91725 states have internal predecessors, (97327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91726 states to 91726 states and 97327 transitions. [2025-03-03 10:45:51,489 INFO L78 Accepts]: Start accepts. Automaton has 91726 states and 97327 transitions. Word has length 435 [2025-03-03 10:45:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:51,490 INFO L471 AbstractCegarLoop]: Abstraction has 91726 states and 97327 transitions. [2025-03-03 10:45:51,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 91726 states and 97327 transitions. [2025-03-03 10:45:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 10:45:51,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:51,498 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:51,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:45:51,699 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-03 10:45:51,699 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash 687161542, now seen corresponding path program 1 times [2025-03-03 10:45:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024075024] [2025-03-03 10:45:51,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:51,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:45:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:45:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 110 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:45:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024075024] [2025-03-03 10:45:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024075024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133779859] [2025-03-03 10:45:52,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:52,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:52,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:52,630 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:52,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:45:52,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:45:52,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:45:52,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:52,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:45:52,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 10:45:52,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:52,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133779859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:52,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:52,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:45:52,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022722529] [2025-03-03 10:45:52,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:52,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:52,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:52,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:52,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:45:52,775 INFO L87 Difference]: Start difference. First operand 91726 states and 97327 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:56,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:45:56,206 INFO L93 Difference]: Finished difference Result 230661 states and 244977 transitions. [2025-03-03 10:45:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:45:56,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 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 498 [2025-03-03 10:45:56,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:45:56,360 INFO L225 Difference]: With dead ends: 230661 [2025-03-03 10:45:56,360 INFO L226 Difference]: Without dead ends: 137355 [2025-03-03 10:45:56,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 497 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-03 10:45:56,408 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 923 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:45:56,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1745 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:45:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137355 states. [2025-03-03 10:45:57,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137355 to 120812. [2025-03-03 10:45:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120812 states, 120811 states have (on average 1.0547797799869216) internal successors, (127429), 120811 states have internal predecessors, (127429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120812 states to 120812 states and 127429 transitions. [2025-03-03 10:45:57,839 INFO L78 Accepts]: Start accepts. Automaton has 120812 states and 127429 transitions. Word has length 498 [2025-03-03 10:45:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:45:57,839 INFO L471 AbstractCegarLoop]: Abstraction has 120812 states and 127429 transitions. [2025-03-03 10:45:57,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:45:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 120812 states and 127429 transitions. [2025-03-03 10:45:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-03 10:45:57,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:45:57,847 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:45:57,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:45:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:45:58,047 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:45:58,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:45:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1345544421, now seen corresponding path program 1 times [2025-03-03 10:45:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:45:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956681990] [2025-03-03 10:45:58,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:45:58,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:45:58,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:45:58,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:58,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 247 proven. 113 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:45:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:45:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956681990] [2025-03-03 10:45:59,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956681990] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:45:59,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425922213] [2025-03-03 10:45:59,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:45:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:45:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:45:59,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:45:59,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:45:59,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-03 10:45:59,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-03 10:45:59,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:45:59,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:45:59,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:45:59,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:45:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-03-03 10:45:59,843 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:45:59,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425922213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:45:59,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:45:59,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-03 10:45:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502582176] [2025-03-03 10:45:59,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:45:59,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:45:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:45:59,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:45:59,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:45:59,845 INFO L87 Difference]: Start difference. First operand 120812 states and 127429 transitions. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 2 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)