./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 01:54:30,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:54:30,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:54:30,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:54:30,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:54:30,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:54:30,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:54:30,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:54:30,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:54:30,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:54:30,357 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:54:30,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:54:30,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:54:30,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:54:30,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:54:30,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:54:30,358 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:54:30,358 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:54:30,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:54:30,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:54:30,359 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-08 01:54:30,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:54:30,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:54:30,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:54:30,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:54:30,613 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:54:30,614 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-08 01:54:31,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9481291/125457e027154ac4a8b4b4e0f4a43ea3/FLAG8b18f48fa [2025-03-08 01:54:32,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:54:32,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label45.c [2025-03-08 01:54:32,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9481291/125457e027154ac4a8b4b4e0f4a43ea3/FLAG8b18f48fa [2025-03-08 01:54:32,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df9481291/125457e027154ac4a8b4b4e0f4a43ea3 [2025-03-08 01:54:32,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:54:32,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:54:32,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:54:32,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:54:32,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:54:32,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:54:32" (1/1) ... [2025-03-08 01:54:32,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14924845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:32, skipping insertion in model container [2025-03-08 01:54:32,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:54:32" (1/1) ... [2025-03-08 01:54:32,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:54:32,606 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-08 01:54:33,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:54:33,178 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:54:33,189 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-08 01:54:33,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:54:33,516 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:54:33,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33 WrapperNode [2025-03-08 01:54:33,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:54:33,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:54:33,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:54:33,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:54:33,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:33,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:33,981 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-08 01:54:33,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:54:33,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:54:33,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:54:33,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:54:33,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:33,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:54:34,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,482 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:54:34,543 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:54:34,543 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:54:34,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:54:34,545 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (1/1) ... [2025-03-08 01:54:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:54:34,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:34,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:54:34,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:54:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:54:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:54:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:54:34,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:54:34,653 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:54:34,655 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:54:38,726 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-08 01:54:38,727 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-08 01:54:38,727 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-08 01:54:38,933 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-08 01:54:38,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:54:38,960 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:54:38,960 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:54:38,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:54:38 BoogieIcfgContainer [2025-03-08 01:54:38,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:54:38,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:54:38,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:54:38,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:54:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:54:32" (1/3) ... [2025-03-08 01:54:38,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62caae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:54:38, skipping insertion in model container [2025-03-08 01:54:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:54:33" (2/3) ... [2025-03-08 01:54:38,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62caae86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:54:38, skipping insertion in model container [2025-03-08 01:54:38,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:54:38" (3/3) ... [2025-03-08 01:54:38,972 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label45.c [2025-03-08 01:54:38,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:54:38,985 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-08 01:54:39,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:54:39,064 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;@37259277, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:54:39,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:54:39,071 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-08 01:54:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-08 01:54:39,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:39,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:54:39,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:39,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:39,079 INFO L85 PathProgramCache]: Analyzing trace with hash 139995337, now seen corresponding path program 1 times [2025-03-08 01:54:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:39,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899209370] [2025-03-08 01:54:39,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:39,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-08 01:54:39,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-08 01:54:39,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:39,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:54:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899209370] [2025-03-08 01:54:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899209370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:39,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:39,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335560618] [2025-03-08 01:54:39,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:39,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:39,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:39,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:39,258 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-08 01:54:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:42,277 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-03-08 01:54:42,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:42,279 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-08 01:54:42,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:42,292 INFO L225 Difference]: With dead ends: 3035 [2025-03-08 01:54:42,293 INFO L226 Difference]: Without dead ends: 1873 [2025-03-08 01:54:42,297 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-08 01:54:42,299 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 898 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:42,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 01:54:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-03-08 01:54:42,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-03-08 01:54:42,378 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-08 01:54:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-03-08 01:54:42,389 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 7 [2025-03-08 01:54:42,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:42,389 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-03-08 01:54:42,390 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-08 01:54:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-03-08 01:54:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 01:54:42,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:42,391 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-08 01:54:42,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:54:42,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:42,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1894849901, now seen corresponding path program 1 times [2025-03-08 01:54:42,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:42,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596041013] [2025-03-08 01:54:42,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:42,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:42,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 01:54:42,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 01:54:42,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:42,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:42,700 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-08 01:54:42,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:42,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596041013] [2025-03-08 01:54:42,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596041013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:42,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:42,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:42,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457432232] [2025-03-08 01:54:42,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:42,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:42,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:42,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:42,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:42,703 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-08 01:54:45,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:45,493 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-03-08 01:54:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:45,493 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-08 01:54:45,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:45,503 INFO L225 Difference]: With dead ends: 5317 [2025-03-08 01:54:45,503 INFO L226 Difference]: Without dead ends: 3460 [2025-03-08 01:54:45,504 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-08 01:54:45,505 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:45,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:54:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-03-08 01:54:45,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-03-08 01:54:45,544 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-08 01:54:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-03-08 01:54:45,548 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 79 [2025-03-08 01:54:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-03-08 01:54:45,549 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-08 01:54:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-03-08 01:54:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 01:54:45,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:45,550 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-08 01:54:45,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:54:45,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash 211681035, now seen corresponding path program 1 times [2025-03-08 01:54:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207949453] [2025-03-08 01:54:45,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:45,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 01:54:45,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 01:54:45,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:45,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:45,687 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-08 01:54:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:45,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207949453] [2025-03-08 01:54:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207949453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:45,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:45,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643074390] [2025-03-08 01:54:45,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:45,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:45,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:45,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:45,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:45,689 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-08 01:54:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:48,540 INFO L93 Difference]: Finished difference Result 10097 states and 13940 transitions. [2025-03-08 01:54:48,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:48,540 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-08 01:54:48,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:48,559 INFO L225 Difference]: With dead ends: 10097 [2025-03-08 01:54:48,560 INFO L226 Difference]: Without dead ends: 6640 [2025-03-08 01:54:48,565 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-08 01:54:48,566 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:48,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 904 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 01:54:48,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-03-08 01:54:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6631. [2025-03-08 01:54:48,660 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-08 01:54:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-03-08 01:54:48,671 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 93 [2025-03-08 01:54:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:48,672 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-03-08 01:54:48,672 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-08 01:54:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-03-08 01:54:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 01:54:48,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:48,674 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-08 01:54:48,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:54:48,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:48,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash 670916723, now seen corresponding path program 1 times [2025-03-08 01:54:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:48,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393247072] [2025-03-08 01:54:48,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:48,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 01:54:48,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 01:54:48,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:48,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:48,808 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-08 01:54:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393247072] [2025-03-08 01:54:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393247072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:48,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:48,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:48,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825926413] [2025-03-08 01:54:48,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:48,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:48,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:48,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:48,809 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-08 01:54:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:51,645 INFO L93 Difference]: Finished difference Result 16421 states and 21400 transitions. [2025-03-08 01:54:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:51,645 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-08 01:54:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:51,675 INFO L225 Difference]: With dead ends: 16421 [2025-03-08 01:54:51,675 INFO L226 Difference]: Without dead ends: 9792 [2025-03-08 01:54:51,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:51,685 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 990 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:51,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 1690 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:54:51,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9792 states. [2025-03-08 01:54:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9792 to 9783. [2025-03-08 01:54:51,798 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-08 01:54:51,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9783 states to 9783 states and 12481 transitions. [2025-03-08 01:54:51,810 INFO L78 Accepts]: Start accepts. Automaton has 9783 states and 12481 transitions. Word has length 96 [2025-03-08 01:54:51,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:51,811 INFO L471 AbstractCegarLoop]: Abstraction has 9783 states and 12481 transitions. [2025-03-08 01:54:51,811 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-08 01:54:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 9783 states and 12481 transitions. [2025-03-08 01:54:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 01:54:51,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:51,813 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-08 01:54:51,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:54:51,813 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:51,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2059577131, now seen corresponding path program 1 times [2025-03-08 01:54:51,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:51,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919728209] [2025-03-08 01:54:51,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:51,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:51,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 01:54:51,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 01:54:51,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:51,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:52,091 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-08 01:54:52,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919728209] [2025-03-08 01:54:52,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919728209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:54:52,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896944462] [2025-03-08 01:54:52,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:54:52,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:54:52,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:54:52,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:54:52,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 01:54:52,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 01:54:52,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:52,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:52,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:54:52,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:54:52,276 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-08 01:54:52,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:54:52,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896944462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:52,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:54:52,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 01:54:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827541618] [2025-03-08 01:54:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:52,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:52,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:52,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:54:52,278 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-08 01:54:54,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:54,809 INFO L93 Difference]: Finished difference Result 29147 states and 37191 transitions. [2025-03-08 01:54:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:54,809 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-08 01:54:54,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:54,844 INFO L225 Difference]: With dead ends: 29147 [2025-03-08 01:54:54,845 INFO L226 Difference]: Without dead ends: 19366 [2025-03-08 01:54:54,854 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-08 01:54:54,855 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 1045 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:54,855 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.4s Time] [2025-03-08 01:54:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19366 states. [2025-03-08 01:54:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19366 to 19349. [2025-03-08 01:54:55,049 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-08 01:54:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19349 states to 19349 states and 23603 transitions. [2025-03-08 01:54:55,070 INFO L78 Accepts]: Start accepts. Automaton has 19349 states and 23603 transitions. Word has length 103 [2025-03-08 01:54:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 19349 states and 23603 transitions. [2025-03-08 01:54:55,072 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-08 01:54:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19349 states and 23603 transitions. [2025-03-08 01:54:55,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 01:54:55,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:55,078 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-08 01:54:55,084 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-08 01:54:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:54:55,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:55,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:55,284 INFO L85 PathProgramCache]: Analyzing trace with hash 515355778, now seen corresponding path program 1 times [2025-03-08 01:54:55,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204850682] [2025-03-08 01:54:55,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:55,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:55,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 01:54:55,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 01:54:55,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:55,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:55,407 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-08 01:54:55,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:55,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204850682] [2025-03-08 01:54:55,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204850682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:55,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:55,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:54:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143715869] [2025-03-08 01:54:55,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:55,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:55,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:55,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:55,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:55,408 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-08 01:54:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:54:57,627 INFO L93 Difference]: Finished difference Result 38566 states and 47028 transitions. [2025-03-08 01:54:57,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:54:57,628 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-08 01:54:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:54:57,654 INFO L225 Difference]: With dead ends: 38566 [2025-03-08 01:54:57,655 INFO L226 Difference]: Without dead ends: 19219 [2025-03-08 01:54:57,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:57,669 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1023 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:54:57,669 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.1s Time] [2025-03-08 01:54:57,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19219 states. [2025-03-08 01:54:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19219 to 18429. [2025-03-08 01:54:57,813 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-08 01:54:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18429 states to 18429 states and 21257 transitions. [2025-03-08 01:54:57,830 INFO L78 Accepts]: Start accepts. Automaton has 18429 states and 21257 transitions. Word has length 228 [2025-03-08 01:54:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:54:57,831 INFO L471 AbstractCegarLoop]: Abstraction has 18429 states and 21257 transitions. [2025-03-08 01:54:57,831 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-08 01:54:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18429 states and 21257 transitions. [2025-03-08 01:54:57,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2025-03-08 01:54:57,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:54:57,837 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-08 01:54:57,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:54:57,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:54:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:54:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 529717422, now seen corresponding path program 1 times [2025-03-08 01:54:57,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:54:57,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800785457] [2025-03-08 01:54:57,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:54:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:54:57,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes. [2025-03-08 01:54:57,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements. [2025-03-08 01:54:57,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:54:57,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:54:58,167 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-08 01:54:58,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:54:58,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800785457] [2025-03-08 01:54:58,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800785457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:54:58,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:54:58,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:54:58,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128074947] [2025-03-08 01:54:58,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:54:58,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:54:58,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:54:58,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:54:58,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:54:58,170 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-08 01:55:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:00,562 INFO L93 Difference]: Finished difference Result 37643 states and 43314 transitions. [2025-03-08 01:55:00,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:00,562 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-08 01:55:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:00,586 INFO L225 Difference]: With dead ends: 37643 [2025-03-08 01:55:00,586 INFO L226 Difference]: Without dead ends: 19216 [2025-03-08 01:55:00,601 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-08 01:55:00,603 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:00,603 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.3s Time] [2025-03-08 01:55:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19216 states. [2025-03-08 01:55:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19216 to 19216. [2025-03-08 01:55:00,753 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-08 01:55:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19216 states to 19216 states and 22049 transitions. [2025-03-08 01:55:00,770 INFO L78 Accepts]: Start accepts. Automaton has 19216 states and 22049 transitions. Word has length 240 [2025-03-08 01:55:00,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:00,771 INFO L471 AbstractCegarLoop]: Abstraction has 19216 states and 22049 transitions. [2025-03-08 01:55:00,771 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-08 01:55:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19216 states and 22049 transitions. [2025-03-08 01:55:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-08 01:55:00,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:00,774 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-08 01:55:00,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:55:00,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:00,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1522642192, now seen corresponding path program 1 times [2025-03-08 01:55:00,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:00,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803109721] [2025-03-08 01:55:00,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:00,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 01:55:00,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 01:55:00,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:00,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:00,945 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-08 01:55:00,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:00,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803109721] [2025-03-08 01:55:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803109721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776072330] [2025-03-08 01:55:00,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:00,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:55:00,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:00,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:55:00,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:55:00,947 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-08 01:55:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:05,979 INFO L93 Difference]: Finished difference Result 70902 states and 81557 transitions. [2025-03-08 01:55:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:55:05,980 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-08 01:55:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:06,040 INFO L225 Difference]: With dead ends: 70902 [2025-03-08 01:55:06,040 INFO L226 Difference]: Without dead ends: 52475 [2025-03-08 01:55:06,057 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-08 01:55:06,058 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1733 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 6790 mSolverCounterSat, 1026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s 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, 4.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:06,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 915 Invalid, 7816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1026 Valid, 6790 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-08 01:55:06,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52475 states. [2025-03-08 01:55:06,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52475 to 50779. [2025-03-08 01:55:06,472 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-08 01:55:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50779 states to 50779 states and 57325 transitions. [2025-03-08 01:55:06,666 INFO L78 Accepts]: Start accepts. Automaton has 50779 states and 57325 transitions. Word has length 247 [2025-03-08 01:55:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:06,667 INFO L471 AbstractCegarLoop]: Abstraction has 50779 states and 57325 transitions. [2025-03-08 01:55:06,668 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-08 01:55:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 50779 states and 57325 transitions. [2025-03-08 01:55:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-08 01:55:06,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:06,671 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-08 01:55:06,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:55:06,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:06,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2074948170, now seen corresponding path program 1 times [2025-03-08 01:55:06,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:06,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090701066] [2025-03-08 01:55:06,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:06,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:06,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-08 01:55:06,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-08 01:55:06,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:06,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:06,826 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-08 01:55:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090701066] [2025-03-08 01:55:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090701066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:06,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:06,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:06,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598742676] [2025-03-08 01:55:06,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:06,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:06,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:06,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:06,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:06,828 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-08 01:55:09,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:09,353 INFO L93 Difference]: Finished difference Result 102349 states and 115450 transitions. [2025-03-08 01:55:09,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:09,354 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-08 01:55:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:09,411 INFO L225 Difference]: With dead ends: 102349 [2025-03-08 01:55:09,411 INFO L226 Difference]: Without dead ends: 52359 [2025-03-08 01:55:09,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:09,443 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 828 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 747 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:09,443 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.3s Time] [2025-03-08 01:55:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52359 states. [2025-03-08 01:55:09,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52359 to 50775. [2025-03-08 01:55:09,899 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-08 01:55:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50775 states to 50775 states and 55636 transitions. [2025-03-08 01:55:09,946 INFO L78 Accepts]: Start accepts. Automaton has 50775 states and 55636 transitions. Word has length 305 [2025-03-08 01:55:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:09,946 INFO L471 AbstractCegarLoop]: Abstraction has 50775 states and 55636 transitions. [2025-03-08 01:55:09,946 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-08 01:55:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 50775 states and 55636 transitions. [2025-03-08 01:55:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-03-08 01:55:09,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:09,950 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-08 01:55:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:55:09,950 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:09,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2140227106, now seen corresponding path program 1 times [2025-03-08 01:55:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505845121] [2025-03-08 01:55:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:09,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-08 01:55:09,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-08 01:55:09,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:09,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:11,172 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-08 01:55:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505845121] [2025-03-08 01:55:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505845121] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640976052] [2025-03-08 01:55:11,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:11,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:11,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:11,175 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:11,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:55:11,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-03-08 01:55:11,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-03-08 01:55:11,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:11,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:11,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 01:55:11,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:11,686 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-08 01:55:11,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:11,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640976052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:11,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:11,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:55:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45148188] [2025-03-08 01:55:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:11,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:55:11,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:11,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:55:11,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:55:11,688 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-08 01:55:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:16,024 INFO L93 Difference]: Finished difference Result 130843 states and 143457 transitions. [2025-03-08 01:55:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:55:16,024 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-08 01:55:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:16,101 INFO L225 Difference]: With dead ends: 130843 [2025-03-08 01:55:16,101 INFO L226 Difference]: Without dead ends: 80857 [2025-03-08 01:55:16,127 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-08 01:55:16,127 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1691 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 5877 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s 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, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:16,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 785 Invalid, 6657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 5877 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 01:55:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80857 states. [2025-03-08 01:55:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80857 to 79960. [2025-03-08 01:55:16,868 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-08 01:55:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79960 states to 79960 states and 87537 transitions. [2025-03-08 01:55:16,961 INFO L78 Accepts]: Start accepts. Automaton has 79960 states and 87537 transitions. Word has length 336 [2025-03-08 01:55:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:16,962 INFO L471 AbstractCegarLoop]: Abstraction has 79960 states and 87537 transitions. [2025-03-08 01:55:16,962 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-08 01:55:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 79960 states and 87537 transitions. [2025-03-08 01:55:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-08 01:55:16,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:16,966 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-08 01:55:16,972 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-08 01:55:17,166 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-08 01:55:17,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:17,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -433444996, now seen corresponding path program 1 times [2025-03-08 01:55:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123928336] [2025-03-08 01:55:17,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:17,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-08 01:55:17,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-08 01:55:17,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:17,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:17,365 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-08 01:55:17,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123928336] [2025-03-08 01:55:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123928336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:17,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:17,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339551402] [2025-03-08 01:55:17,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:17,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:17,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:17,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:17,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:17,367 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-08 01:55:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:19,909 INFO L93 Difference]: Finished difference Result 160741 states and 175919 transitions. [2025-03-08 01:55:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:19,909 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-08 01:55:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:19,989 INFO L225 Difference]: With dead ends: 160741 [2025-03-08 01:55:19,989 INFO L226 Difference]: Without dead ends: 79994 [2025-03-08 01:55:20,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:20,029 INFO L435 NwaCegarLoop]: 1769 mSDtfsCounter, 720 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:20,029 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.1s Time] [2025-03-08 01:55:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79994 states. [2025-03-08 01:55:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79994 to 79168. [2025-03-08 01:55:20,638 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-08 01:55:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79168 states to 79168 states and 85808 transitions. [2025-03-08 01:55:20,710 INFO L78 Accepts]: Start accepts. Automaton has 79168 states and 85808 transitions. Word has length 340 [2025-03-08 01:55:20,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:20,711 INFO L471 AbstractCegarLoop]: Abstraction has 79168 states and 85808 transitions. [2025-03-08 01:55:20,711 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-08 01:55:20,711 INFO L276 IsEmpty]: Start isEmpty. Operand 79168 states and 85808 transitions. [2025-03-08 01:55:20,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 01:55:20,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:20,714 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-08 01:55:20,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:55:20,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:20,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1653614971, now seen corresponding path program 1 times [2025-03-08 01:55:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701898021] [2025-03-08 01:55:20,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:20,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:20,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 01:55:20,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 01:55:20,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:20,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:21,042 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-08 01:55:21,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701898021] [2025-03-08 01:55:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701898021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:55:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:55:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152543233] [2025-03-08 01:55:21,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:21,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:21,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:21,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:21,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:21,044 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-08 01:55:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:23,530 INFO L93 Difference]: Finished difference Result 182738 states and 199272 transitions. [2025-03-08 01:55:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:23,531 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-08 01:55:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:23,650 INFO L225 Difference]: With dead ends: 182738 [2025-03-08 01:55:23,651 INFO L226 Difference]: Without dead ends: 104359 [2025-03-08 01:55:23,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:55:23,704 INFO L435 NwaCegarLoop]: 1757 mSDtfsCounter, 791 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:23,705 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.1s Time] [2025-03-08 01:55:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104359 states. [2025-03-08 01:55:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104359 to 99624. [2025-03-08 01:55:24,636 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-08 01:55:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99624 states to 99624 states and 107490 transitions. [2025-03-08 01:55:24,726 INFO L78 Accepts]: Start accepts. Automaton has 99624 states and 107490 transitions. Word has length 369 [2025-03-08 01:55:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:24,726 INFO L471 AbstractCegarLoop]: Abstraction has 99624 states and 107490 transitions. [2025-03-08 01:55:24,727 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-08 01:55:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 99624 states and 107490 transitions. [2025-03-08 01:55:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-08 01:55:24,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:24,730 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-08 01:55:24,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 01:55:24,730 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:24,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:24,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1039235433, now seen corresponding path program 1 times [2025-03-08 01:55:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:24,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732157775] [2025-03-08 01:55:24,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:24,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:24,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 01:55:24,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 01:55:24,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:24,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:25,762 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-08 01:55:25,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732157775] [2025-03-08 01:55:25,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732157775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:25,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288313248] [2025-03-08 01:55:25,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:25,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:25,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:25,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:25,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:55:25,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-08 01:55:25,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-08 01:55:25,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:25,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:25,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:55:25,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:26,010 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-08 01:55:26,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288313248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:26,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:55:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647640843] [2025-03-08 01:55:26,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:26,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:26,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:26,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:26,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:55:26,012 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-08 01:55:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:28,779 INFO L93 Difference]: Finished difference Result 231514 states and 251126 transitions. [2025-03-08 01:55:28,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:28,779 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-08 01:55:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:28,925 INFO L225 Difference]: With dead ends: 231514 [2025-03-08 01:55:28,925 INFO L226 Difference]: Without dead ends: 131891 [2025-03-08 01:55:29,097 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-08 01:55:29,097 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 968 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:29,098 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.3s Time] [2025-03-08 01:55:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131891 states. [2025-03-08 01:55:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131891 to 94885. [2025-03-08 01:55:30,042 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-08 01:55:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94885 states to 94885 states and 102193 transitions. [2025-03-08 01:55:30,129 INFO L78 Accepts]: Start accepts. Automaton has 94885 states and 102193 transitions. Word has length 408 [2025-03-08 01:55:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:30,129 INFO L471 AbstractCegarLoop]: Abstraction has 94885 states and 102193 transitions. [2025-03-08 01:55:30,130 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-08 01:55:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 94885 states and 102193 transitions. [2025-03-08 01:55:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2025-03-08 01:55:30,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:30,133 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-08 01:55:30,139 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-08 01:55:30,333 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-08 01:55:30,334 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -229701036, now seen corresponding path program 1 times [2025-03-08 01:55:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:30,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967070167] [2025-03-08 01:55:30,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:30,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:30,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 01:55:30,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 01:55:30,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:30,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:31,262 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-08 01:55:31,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967070167] [2025-03-08 01:55:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967070167] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899654210] [2025-03-08 01:55:31,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:31,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:55:31,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 435 statements into 1 equivalence classes. [2025-03-08 01:55:31,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 435 of 435 statements. [2025-03-08 01:55:31,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:31,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:31,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:55:31,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:31,639 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-08 01:55:31,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899654210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:31,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:31,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:55:31,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744512261] [2025-03-08 01:55:31,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:31,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:31,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:31,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:31,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:55:31,641 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-08 01:55:34,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:34,331 INFO L93 Difference]: Finished difference Result 185823 states and 200156 transitions. [2025-03-08 01:55:34,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:34,331 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-08 01:55:34,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:34,435 INFO L225 Difference]: With dead ends: 185823 [2025-03-08 01:55:34,435 INFO L226 Difference]: Without dead ends: 91727 [2025-03-08 01:55:34,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 434 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-08 01:55:34,491 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 1093 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:34,491 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.3s Time] [2025-03-08 01:55:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91727 states. [2025-03-08 01:55:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91727 to 91726. [2025-03-08 01:55:35,352 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-08 01:55:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91726 states to 91726 states and 97327 transitions. [2025-03-08 01:55:35,430 INFO L78 Accepts]: Start accepts. Automaton has 91726 states and 97327 transitions. Word has length 435 [2025-03-08 01:55:35,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:35,430 INFO L471 AbstractCegarLoop]: Abstraction has 91726 states and 97327 transitions. [2025-03-08 01:55:35,430 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-08 01:55:35,430 INFO L276 IsEmpty]: Start isEmpty. Operand 91726 states and 97327 transitions. [2025-03-08 01:55:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-08 01:55:35,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:35,435 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-08 01:55:35,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 01:55:35,635 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-08 01:55:35,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:35,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:35,636 INFO L85 PathProgramCache]: Analyzing trace with hash 687161542, now seen corresponding path program 1 times [2025-03-08 01:55:35,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:35,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600710793] [2025-03-08 01:55:35,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:35,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:35,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 01:55:35,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 01:55:35,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:35,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:36,433 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-08 01:55:36,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600710793] [2025-03-08 01:55:36,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600710793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:36,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205677789] [2025-03-08 01:55:36,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:36,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:36,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:36,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:36,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 01:55:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 01:55:36,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 01:55:36,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:36,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:36,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:55:36,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:36,587 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-08 01:55:36,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:36,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205677789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:36,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:36,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-08 01:55:36,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462994590] [2025-03-08 01:55:36,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:36,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:36,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:36,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:36,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:55:36,589 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-08 01:55:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:39,686 INFO L93 Difference]: Finished difference Result 230661 states and 244977 transitions. [2025-03-08 01:55:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:39,687 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-08 01:55:39,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:39,849 INFO L225 Difference]: With dead ends: 230661 [2025-03-08 01:55:39,850 INFO L226 Difference]: Without dead ends: 137355 [2025-03-08 01:55:39,897 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-08 01:55:39,898 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 923 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:39,898 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.7s Time] [2025-03-08 01:55:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137355 states. [2025-03-08 01:55:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137355 to 120812. [2025-03-08 01:55:41,060 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-08 01:55:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120812 states to 120812 states and 127429 transitions. [2025-03-08 01:55:41,212 INFO L78 Accepts]: Start accepts. Automaton has 120812 states and 127429 transitions. Word has length 498 [2025-03-08 01:55:41,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:41,212 INFO L471 AbstractCegarLoop]: Abstraction has 120812 states and 127429 transitions. [2025-03-08 01:55:41,212 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-08 01:55:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 120812 states and 127429 transitions. [2025-03-08 01:55:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-08 01:55:41,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:41,219 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-08 01:55:41,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 01:55:41,419 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-08 01:55:41,420 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1345544421, now seen corresponding path program 1 times [2025-03-08 01:55:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561123670] [2025-03-08 01:55:41,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:41,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 01:55:41,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 01:55:41,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:41,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:42,591 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-08 01:55:42,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561123670] [2025-03-08 01:55:42,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561123670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:42,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667935661] [2025-03-08 01:55:42,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:42,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:42,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:42,593 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:42,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 01:55:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 01:55:42,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 01:55:42,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:42,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:42,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:55:42,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:43,284 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-08 01:55:43,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:55:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667935661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:55:43,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:55:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-03-08 01:55:43,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048982326] [2025-03-08 01:55:43,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:55:43,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:55:43,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:43,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:55:43,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:55:43,286 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) [2025-03-08 01:55:45,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:55:45,549 INFO L93 Difference]: Finished difference Result 242417 states and 255661 transitions. [2025-03-08 01:55:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:55:45,549 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 498 [2025-03-08 01:55:45,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:55:45,679 INFO L225 Difference]: With dead ends: 242417 [2025-03-08 01:55:45,679 INFO L226 Difference]: Without dead ends: 120808 [2025-03-08 01:55:45,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:55:45,740 INFO L435 NwaCegarLoop]: 975 mSDtfsCounter, 682 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:55:45,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1105 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 01:55:45,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120808 states. [2025-03-08 01:55:46,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120808 to 120800. [2025-03-08 01:55:46,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120800 states, 120799 states have (on average 1.0501328653382893) internal successors, (126855), 120799 states have internal predecessors, (126855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:55:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120800 states to 120800 states and 126855 transitions. [2025-03-08 01:55:46,861 INFO L78 Accepts]: Start accepts. Automaton has 120800 states and 126855 transitions. Word has length 498 [2025-03-08 01:55:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:55:46,861 INFO L471 AbstractCegarLoop]: Abstraction has 120800 states and 126855 transitions. [2025-03-08 01:55:46,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-03-08 01:55:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 120800 states and 126855 transitions. [2025-03-08 01:55:46,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-03-08 01:55:46,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:55:46,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 01:55:46,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 01:55:47,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 01:55:47,070 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:55:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:55:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash 893490202, now seen corresponding path program 1 times [2025-03-08 01:55:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:55:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375037327] [2025-03-08 01:55:47,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:55:47,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-08 01:55:47,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-08 01:55:47,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:47,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:49,006 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-08 01:55:49,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:55:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375037327] [2025-03-08 01:55:49,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375037327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:55:49,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135708781] [2025-03-08 01:55:49,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:55:49,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:55:49,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:55:49,009 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:55:49,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 01:55:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-03-08 01:55:49,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-03-08 01:55:49,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:55:49,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:55:49,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 01:55:49,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:55:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 295 proven. 10 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 01:55:49,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:55:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 295 proven. 10 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 01:55:49,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135708781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:55:49,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:55:49,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 01:55:49,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473482133] [2025-03-08 01:55:49,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:55:49,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 01:55:49,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:55:49,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 01:55:49,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:55:49,824 INFO L87 Difference]: Start difference. First operand 120800 states and 126855 transitions. Second operand has 8 states, 8 states have (on average 77.625) internal successors, (621), 8 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)