./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label15.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label15.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 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:41:34,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:41:34,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:41:34,463 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:41:34,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:41:34,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:41:34,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:41:34,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:41:34,478 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:41:34,478 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:41:34,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:41:34,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:41:34,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:41:34,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:41:34,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:41:34,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:41:34,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:41:34,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:41:34,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:41:34,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:41:34,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:41:34,481 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 -> 9fbc20983083f465b3eede57a226cc56a0e48515578e64c31c2db7f869f449ac [2025-03-03 10:41:34,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:41:34,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:41:34,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:41:34,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:41:34,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:41:34,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-03-03 10:41:35,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a97b7af/17174647e40d4d21a0624531e48eb88c/FLAGecd634bca [2025-03-03 10:41:36,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:41:36,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label15.c [2025-03-03 10:41:36,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a97b7af/17174647e40d4d21a0624531e48eb88c/FLAGecd634bca [2025-03-03 10:41:36,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a97b7af/17174647e40d4d21a0624531e48eb88c [2025-03-03 10:41:36,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:41:36,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:41:36,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:41:36,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:41:36,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:41:36,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:36" (1/1) ... [2025-03-03 10:41:36,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579cf47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:36, skipping insertion in model container [2025-03-03 10:41:36,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:41:36" (1/1) ... [2025-03-03 10:41:36,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:41:36,752 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_label15.c[5297,5310] [2025-03-03 10:41:37,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:41:37,315 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:41:37,334 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_label15.c[5297,5310] [2025-03-03 10:41:37,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:41:37,664 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:41:37,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37 WrapperNode [2025-03-03 10:41:37,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:41:37,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:41:37,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:41:37,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:41:37,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:37,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,122 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-03 10:41:38,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:41:38,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:41:38,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:41:38,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:41:38,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,415 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:41:38,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,576 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:41:38,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:41:38,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:41:38,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:41:38,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (1/1) ... [2025-03-03 10:41:38,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:41:38,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:41:38,779 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:41:38,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:41:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:41:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:41:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:41:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:41:38,852 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:41:38,853 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:41:42,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-03 10:41:42,908 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:41:42,909 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:41:43,053 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-03 10:41:43,053 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:41:43,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:41:43,081 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:41:43,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:43 BoogieIcfgContainer [2025-03-03 10:41:43,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:41:43,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:41:43,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:41:43,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:41:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:41:36" (1/3) ... [2025-03-03 10:41:43,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:43, skipping insertion in model container [2025-03-03 10:41:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:41:37" (2/3) ... [2025-03-03 10:41:43,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64f7ec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:41:43, skipping insertion in model container [2025-03-03 10:41:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:41:43" (3/3) ... [2025-03-03 10:41:43,088 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label15.c [2025-03-03 10:41:43,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:41:43,103 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label15.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:41:43,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:41:43,176 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;@161666e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:41:43,176 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:41:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 10:41:43,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:43,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:43,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:43,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:43,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1457068655, now seen corresponding path program 1 times [2025-03-03 10:41:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140754793] [2025-03-03 10:41:43,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:43,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 10:41:43,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 10:41:43,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:43,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:43,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:43,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140754793] [2025-03-03 10:41:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140754793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:43,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:43,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:43,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317826433] [2025-03-03 10:41:43,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:43,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:43,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:43,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:43,457 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:46,975 INFO L93 Difference]: Finished difference Result 3160 states and 5840 transitions. [2025-03-03 10:41:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:46,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 10:41:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:47,000 INFO L225 Difference]: With dead ends: 3160 [2025-03-03 10:41:47,000 INFO L226 Difference]: Without dead ends: 1983 [2025-03-03 10:41:47,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:47,012 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 1067 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3030 mSolverCounterSat, 974 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 4004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 974 IncrementalHoareTripleChecker+Valid, 3030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:47,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 349 Invalid, 4004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [974 Valid, 3030 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:41:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-03-03 10:41:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1930. [2025-03-03 10:41:47,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1929 states have (on average 1.7973043027475375) internal successors, (3467), 1929 states have internal predecessors, (3467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3467 transitions. [2025-03-03 10:41:47,116 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3467 transitions. Word has length 36 [2025-03-03 10:41:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:47,117 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3467 transitions. [2025-03-03 10:41:47,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3467 transitions. [2025-03-03 10:41:47,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 10:41:47,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:47,120 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:47,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:41:47,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:47,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:47,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1832686922, now seen corresponding path program 1 times [2025-03-03 10:41:47,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:47,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546076774] [2025-03-03 10:41:47,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:47,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:47,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 10:41:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 10:41:47,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:47,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:47,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546076774] [2025-03-03 10:41:47,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546076774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:47,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:47,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:47,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101785705] [2025-03-03 10:41:47,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:47,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:47,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:47,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:47,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:47,496 INFO L87 Difference]: Start difference. First operand 1930 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:50,550 INFO L93 Difference]: Finished difference Result 4718 states and 8523 transitions. [2025-03-03 10:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2025-03-03 10:41:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:50,561 INFO L225 Difference]: With dead ends: 4718 [2025-03-03 10:41:50,561 INFO L226 Difference]: Without dead ends: 2790 [2025-03-03 10:41:50,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:50,565 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 815 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 3015 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 3015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:50,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 737 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 3015 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:41:50,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2790 states. [2025-03-03 10:41:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2790 to 2729. [2025-03-03 10:41:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 1.7001466275659824) internal successors, (4638), 2728 states have internal predecessors, (4638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4638 transitions. [2025-03-03 10:41:50,662 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4638 transitions. Word has length 101 [2025-03-03 10:41:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:50,662 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4638 transitions. [2025-03-03 10:41:50,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4638 transitions. [2025-03-03 10:41:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 10:41:50,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:50,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:50,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:41:50,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:50,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1444850169, now seen corresponding path program 1 times [2025-03-03 10:41:50,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:50,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822756226] [2025-03-03 10:41:50,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:50,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:50,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 10:41:50,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 10:41:50,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:50,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:50,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:50,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822756226] [2025-03-03 10:41:50,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822756226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:50,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:50,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:50,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708007886] [2025-03-03 10:41:50,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:50,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:50,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:50,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:50,799 INFO L87 Difference]: Start difference. First operand 2729 states and 4638 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:53,732 INFO L93 Difference]: Finished difference Result 7862 states and 13450 transitions. [2025-03-03 10:41:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 10:41:53,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:53,747 INFO L225 Difference]: With dead ends: 7862 [2025-03-03 10:41:53,747 INFO L226 Difference]: Without dead ends: 5135 [2025-03-03 10:41:53,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:53,750 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 937 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 3352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:53,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 1015 Invalid, 3352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 10:41:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2025-03-03 10:41:53,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 5127. [2025-03-03 10:41:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5127 states, 5126 states have (on average 1.533164260632072) internal successors, (7859), 5126 states have internal predecessors, (7859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5127 states to 5127 states and 7859 transitions. [2025-03-03 10:41:53,820 INFO L78 Accepts]: Start accepts. Automaton has 5127 states and 7859 transitions. Word has length 107 [2025-03-03 10:41:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:53,822 INFO L471 AbstractCegarLoop]: Abstraction has 5127 states and 7859 transitions. [2025-03-03 10:41:53,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5127 states and 7859 transitions. [2025-03-03 10:41:53,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 10:41:53,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:53,826 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:53,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:41:53,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:53,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash -333032145, now seen corresponding path program 1 times [2025-03-03 10:41:53,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:53,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092657875] [2025-03-03 10:41:53,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:53,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 10:41:53,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 10:41:53,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:53,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:54,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092657875] [2025-03-03 10:41:54,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092657875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:54,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:41:54,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:41:54,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643870537] [2025-03-03 10:41:54,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:54,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:54,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:54,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:54,125 INFO L87 Difference]: Start difference. First operand 5127 states and 7859 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:56,455 INFO L93 Difference]: Finished difference Result 11046 states and 16686 transitions. [2025-03-03 10:41:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:56,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2025-03-03 10:41:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:56,469 INFO L225 Difference]: With dead ends: 11046 [2025-03-03 10:41:56,469 INFO L226 Difference]: Without dead ends: 5921 [2025-03-03 10:41:56,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:41:56,476 INFO L435 NwaCegarLoop]: 1048 mSDtfsCounter, 685 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:56,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1177 Invalid, 2704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:41:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-03-03 10:41:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5915. [2025-03-03 10:41:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 1.4680419343929658) internal successors, (8682), 5914 states have internal predecessors, (8682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 8682 transitions. [2025-03-03 10:41:56,551 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 8682 transitions. Word has length 147 [2025-03-03 10:41:56,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:56,552 INFO L471 AbstractCegarLoop]: Abstraction has 5915 states and 8682 transitions. [2025-03-03 10:41:56,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 2 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:56,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 8682 transitions. [2025-03-03 10:41:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-03 10:41:56,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:56,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:41:56,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:41:56,554 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:41:56,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:41:56,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1807754117, now seen corresponding path program 1 times [2025-03-03 10:41:56,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:41:56,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920226314] [2025-03-03 10:41:56,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:41:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 10:41:56,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 10:41:56,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:56,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:41:57,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:41:57,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920226314] [2025-03-03 10:41:57,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920226314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:41:57,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177219749] [2025-03-03 10:41:57,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:41:57,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:41:57,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:41:57,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:41:57,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:41:57,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-03 10:41:57,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-03 10:41:57,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:41:57,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:41:57,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:41:57,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:41:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 10:41:57,277 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:41:57,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177219749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:41:57,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:41:57,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-03 10:41:57,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580995316] [2025-03-03 10:41:57,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:41:57,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:41:57,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:41:57,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:41:57,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:41:57,278 INFO L87 Difference]: Start difference. First operand 5915 states and 8682 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:59,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:41:59,778 INFO L93 Difference]: Finished difference Result 15807 states and 23906 transitions. [2025-03-03 10:41:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:41:59,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 161 [2025-03-03 10:41:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:41:59,806 INFO L225 Difference]: With dead ends: 15807 [2025-03-03 10:41:59,806 INFO L226 Difference]: Without dead ends: 10682 [2025-03-03 10:41:59,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:41:59,812 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 755 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 3266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:41:59,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 1136 Invalid, 3266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:41:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10682 states. [2025-03-03 10:41:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10682 to 10659. [2025-03-03 10:41:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10659 states, 10658 states have (on average 1.3172264965284293) internal successors, (14039), 10658 states have internal predecessors, (14039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10659 states to 10659 states and 14039 transitions. [2025-03-03 10:41:59,985 INFO L78 Accepts]: Start accepts. Automaton has 10659 states and 14039 transitions. Word has length 161 [2025-03-03 10:41:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:41:59,985 INFO L471 AbstractCegarLoop]: Abstraction has 10659 states and 14039 transitions. [2025-03-03 10:41:59,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:41:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 10659 states and 14039 transitions. [2025-03-03 10:41:59,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-03-03 10:41:59,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:41:59,988 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:41:59,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:42:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:00,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:00,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1940949417, now seen corresponding path program 1 times [2025-03-03 10:42:00,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:00,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10279602] [2025-03-03 10:42:00,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:00,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-03 10:42:00,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-03 10:42:00,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:00,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-03 10:42:00,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:00,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10279602] [2025-03-03 10:42:00,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10279602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:00,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:00,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386673523] [2025-03-03 10:42:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:00,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:00,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:00,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:00,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:00,346 INFO L87 Difference]: Start difference. First operand 10659 states and 14039 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:02,883 INFO L93 Difference]: Finished difference Result 23671 states and 32238 transitions. [2025-03-03 10:42:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 197 [2025-03-03 10:42:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:02,907 INFO L225 Difference]: With dead ends: 23671 [2025-03-03 10:42:02,907 INFO L226 Difference]: Without dead ends: 13801 [2025-03-03 10:42:02,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:02,916 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 880 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2321 mSolverCounterSat, 874 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 874 IncrementalHoareTripleChecker+Valid, 2321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:02,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1019 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [874 Valid, 2321 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:42:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2025-03-03 10:42:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 13798. [2025-03-03 10:42:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13798 states, 13797 states have (on average 1.247155178662028) internal successors, (17207), 13797 states have internal predecessors, (17207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13798 states to 13798 states and 17207 transitions. [2025-03-03 10:42:03,052 INFO L78 Accepts]: Start accepts. Automaton has 13798 states and 17207 transitions. Word has length 197 [2025-03-03 10:42:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:03,052 INFO L471 AbstractCegarLoop]: Abstraction has 13798 states and 17207 transitions. [2025-03-03 10:42:03,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:03,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13798 states and 17207 transitions. [2025-03-03 10:42:03,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-03 10:42:03,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:03,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:42:03,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:42:03,059 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:03,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1388179058, now seen corresponding path program 1 times [2025-03-03 10:42:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:03,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026003795] [2025-03-03 10:42:03,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:03,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:03,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-03 10:42:03,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-03 10:42:03,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:03,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:03,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026003795] [2025-03-03 10:42:03,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026003795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:03,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610544995] [2025-03-03 10:42:03,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:03,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:03,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:03,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:03,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:03,465 INFO L87 Difference]: Start difference. First operand 13798 states and 17207 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:06,216 INFO L93 Difference]: Finished difference Result 33140 states and 42604 transitions. [2025-03-03 10:42:06,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:06,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2025-03-03 10:42:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:06,248 INFO L225 Difference]: With dead ends: 33140 [2025-03-03 10:42:06,248 INFO L226 Difference]: Without dead ends: 20131 [2025-03-03 10:42:06,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:06,256 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 772 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:06,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1943 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:42:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20131 states. [2025-03-03 10:42:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20131 to 20100. [2025-03-03 10:42:06,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20100 states, 20099 states have (on average 1.2067267028210358) internal successors, (24254), 20099 states have internal predecessors, (24254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20100 states to 20100 states and 24254 transitions. [2025-03-03 10:42:06,436 INFO L78 Accepts]: Start accepts. Automaton has 20100 states and 24254 transitions. Word has length 248 [2025-03-03 10:42:06,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:06,437 INFO L471 AbstractCegarLoop]: Abstraction has 20100 states and 24254 transitions. [2025-03-03 10:42:06,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 20100 states and 24254 transitions. [2025-03-03 10:42:06,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 10:42:06,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:06,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:06,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:42:06,440 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1619850828, now seen corresponding path program 1 times [2025-03-03 10:42:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005914740] [2025-03-03 10:42:06,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:06,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:06,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 10:42:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 10:42:06,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:06,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:42:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:06,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005914740] [2025-03-03 10:42:06,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005914740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:06,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229905765] [2025-03-03 10:42:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:06,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:06,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:06,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:06,547 INFO L87 Difference]: Start difference. First operand 20100 states and 24254 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:09,216 INFO L93 Difference]: Finished difference Result 57506 states and 69724 transitions. [2025-03-03 10:42:09,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-03 10:42:09,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:09,279 INFO L225 Difference]: With dead ends: 57506 [2025-03-03 10:42:09,279 INFO L226 Difference]: Without dead ends: 36616 [2025-03-03 10:42:09,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:09,300 INFO L435 NwaCegarLoop]: 1695 mSDtfsCounter, 938 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2420 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:09,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1831 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2420 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36616 states. [2025-03-03 10:42:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36616 to 35823. [2025-03-03 10:42:09,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35823 states, 35822 states have (on average 1.1638378649991625) internal successors, (41691), 35822 states have internal predecessors, (41691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35823 states to 35823 states and 41691 transitions. [2025-03-03 10:42:09,805 INFO L78 Accepts]: Start accepts. Automaton has 35823 states and 41691 transitions. Word has length 250 [2025-03-03 10:42:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:09,807 INFO L471 AbstractCegarLoop]: Abstraction has 35823 states and 41691 transitions. [2025-03-03 10:42:09,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 35823 states and 41691 transitions. [2025-03-03 10:42:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-03 10:42:09,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:09,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:09,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:42:09,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:09,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:09,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1253189949, now seen corresponding path program 1 times [2025-03-03 10:42:09,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:09,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481111436] [2025-03-03 10:42:09,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:09,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:09,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-03 10:42:09,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-03 10:42:09,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:09,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:42:10,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:10,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481111436] [2025-03-03 10:42:10,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481111436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:10,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:10,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:10,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346748533] [2025-03-03 10:42:10,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:10,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:42:10,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:10,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:42:10,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:10,109 INFO L87 Difference]: Start difference. First operand 35823 states and 41691 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:15,321 INFO L93 Difference]: Finished difference Result 106482 states and 124495 transitions. [2025-03-03 10:42:15,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:42:15,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 324 [2025-03-03 10:42:15,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:15,413 INFO L225 Difference]: With dead ends: 106482 [2025-03-03 10:42:15,413 INFO L226 Difference]: Without dead ends: 71448 [2025-03-03 10:42:15,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:15,445 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 1697 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 6236 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 6236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:15,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 1062 Invalid, 7219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 6236 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-03 10:42:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71448 states. [2025-03-03 10:42:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71448 to 49217. [2025-03-03 10:42:15,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49217 states, 49216 states have (on average 1.1442823472041612) internal successors, (56317), 49216 states have internal predecessors, (56317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49217 states to 49217 states and 56317 transitions. [2025-03-03 10:42:16,198 INFO L78 Accepts]: Start accepts. Automaton has 49217 states and 56317 transitions. Word has length 324 [2025-03-03 10:42:16,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:16,198 INFO L471 AbstractCegarLoop]: Abstraction has 49217 states and 56317 transitions. [2025-03-03 10:42:16,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 49217 states and 56317 transitions. [2025-03-03 10:42:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-03-03 10:42:16,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:16,202 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:16,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:42:16,202 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:16,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:16,203 INFO L85 PathProgramCache]: Analyzing trace with hash 417040008, now seen corresponding path program 1 times [2025-03-03 10:42:16,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:16,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259056087] [2025-03-03 10:42:16,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:16,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:16,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:42:16,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:42:16,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 196 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:42:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259056087] [2025-03-03 10:42:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259056087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:17,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298973482] [2025-03-03 10:42:17,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:17,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:42:17,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:42:17,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-03-03 10:42:17,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-03-03 10:42:17,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:17,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:17,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:17,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:17,219 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:17,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298973482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:17,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282766233] [2025-03-03 10:42:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:17,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:17,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:17,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:17,221 INFO L87 Difference]: Start difference. First operand 49217 states and 56317 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:19,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:19,520 INFO L93 Difference]: Finished difference Result 97634 states and 111830 transitions. [2025-03-03 10:42:19,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:19,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 342 [2025-03-03 10:42:19,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:19,573 INFO L225 Difference]: With dead ends: 97634 [2025-03-03 10:42:19,573 INFO L226 Difference]: Without dead ends: 49206 [2025-03-03 10:42:19,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:19,605 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 1073 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:19,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 801 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:42:19,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2025-03-03 10:42:20,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 49203. [2025-03-03 10:42:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49203 states, 49202 states have (on average 1.1063371407666356) internal successors, (54434), 49202 states have internal predecessors, (54434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49203 states to 49203 states and 54434 transitions. [2025-03-03 10:42:20,084 INFO L78 Accepts]: Start accepts. Automaton has 49203 states and 54434 transitions. Word has length 342 [2025-03-03 10:42:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:20,085 INFO L471 AbstractCegarLoop]: Abstraction has 49203 states and 54434 transitions. [2025-03-03 10:42:20,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 49203 states and 54434 transitions. [2025-03-03 10:42:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-03 10:42:20,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:20,090 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:42:20,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:42:20,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:42:20,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:20,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:20,295 INFO L85 PathProgramCache]: Analyzing trace with hash 57726, now seen corresponding path program 1 times [2025-03-03 10:42:20,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:20,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393942722] [2025-03-03 10:42:20,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:20,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:20,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:42:20,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:42:20,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:20,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:42:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:21,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393942722] [2025-03-03 10:42:21,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393942722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989140938] [2025-03-03 10:42:21,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:21,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:21,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:21,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:42:21,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:42:21,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-03 10:42:21,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-03 10:42:21,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:21,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:21,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:21,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-03 10:42:21,658 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989140938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706477902] [2025-03-03 10:42:21,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:21,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:21,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:21,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:21,659 INFO L87 Difference]: Start difference. First operand 49203 states and 54434 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:24,869 INFO L93 Difference]: Finished difference Result 97615 states and 108073 transitions. [2025-03-03 10:42:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:24,869 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 391 [2025-03-03 10:42:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:24,919 INFO L225 Difference]: With dead ends: 97615 [2025-03-03 10:42:24,919 INFO L226 Difference]: Without dead ends: 49201 [2025-03-03 10:42:24,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:24,934 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1084 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:24,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1422 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:42:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49201 states. [2025-03-03 10:42:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49201 to 49200. [2025-03-03 10:42:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49200 states, 49199 states have (on average 1.083985446858676) internal successors, (53331), 49199 states have internal predecessors, (53331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49200 states to 49200 states and 53331 transitions. [2025-03-03 10:42:25,309 INFO L78 Accepts]: Start accepts. Automaton has 49200 states and 53331 transitions. Word has length 391 [2025-03-03 10:42:25,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:25,310 INFO L471 AbstractCegarLoop]: Abstraction has 49200 states and 53331 transitions. [2025-03-03 10:42:25,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:25,310 INFO L276 IsEmpty]: Start isEmpty. Operand 49200 states and 53331 transitions. [2025-03-03 10:42:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-03-03 10:42:25,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:25,313 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:25,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 10:42:25,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:25,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:25,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1435284094, now seen corresponding path program 1 times [2025-03-03 10:42:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856928226] [2025-03-03 10:42:25,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:25,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:25,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-03-03 10:42:25,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-03-03 10:42:25,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:25,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 10:42:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856928226] [2025-03-03 10:42:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856928226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733185937] [2025-03-03 10:42:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:25,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:25,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:25,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:25,648 INFO L87 Difference]: Start difference. First operand 49200 states and 53331 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:28,256 INFO L93 Difference]: Finished difference Result 114150 states and 124943 transitions. [2025-03-03 10:42:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:28,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 392 [2025-03-03 10:42:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:28,320 INFO L225 Difference]: With dead ends: 114150 [2025-03-03 10:42:28,320 INFO L226 Difference]: Without dead ends: 65739 [2025-03-03 10:42:28,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:28,350 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 890 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:28,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 877 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65739 states. [2025-03-03 10:42:28,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65739 to 64150. [2025-03-03 10:42:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64150 states, 64149 states have (on average 1.090757455299381) internal successors, (69971), 64149 states have internal predecessors, (69971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64150 states to 64150 states and 69971 transitions. [2025-03-03 10:42:28,975 INFO L78 Accepts]: Start accepts. Automaton has 64150 states and 69971 transitions. Word has length 392 [2025-03-03 10:42:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:28,976 INFO L471 AbstractCegarLoop]: Abstraction has 64150 states and 69971 transitions. [2025-03-03 10:42:28,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 64150 states and 69971 transitions. [2025-03-03 10:42:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 10:42:28,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:28,983 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:42:28,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:42:28,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:28,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:28,984 INFO L85 PathProgramCache]: Analyzing trace with hash 2131737006, now seen corresponding path program 1 times [2025-03-03 10:42:28,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:28,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986880038] [2025-03-03 10:42:28,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:28,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:29,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 10:42:29,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 10:42:29,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:29,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:30,157 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 305 proven. 113 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:42:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986880038] [2025-03-03 10:42:30,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986880038] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:42:30,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860113945] [2025-03-03 10:42:30,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:30,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:30,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:42:30,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:42:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:42:30,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 10:42:30,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 10:42:30,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:30,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:30,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:42:30,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:42:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-03 10:42:30,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:42:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860113945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:30,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:42:30,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-03 10:42:30,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817925455] [2025-03-03 10:42:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:30,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:30,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:30,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:30,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:30,569 INFO L87 Difference]: Start difference. First operand 64150 states and 69971 transitions. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:33,137 INFO L93 Difference]: Finished difference Result 138514 states and 151491 transitions. [2025-03-03 10:42:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 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 466 [2025-03-03 10:42:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:33,215 INFO L225 Difference]: With dead ends: 138514 [2025-03-03 10:42:33,215 INFO L226 Difference]: Without dead ends: 75153 [2025-03-03 10:42:33,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:42:33,234 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1133 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:33,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 392 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75153 states. [2025-03-03 10:42:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75153 to 75153. [2025-03-03 10:42:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75153 states, 75152 states have (on average 1.083005109644454) internal successors, (81390), 75152 states have internal predecessors, (81390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:33,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75153 states to 75153 states and 81390 transitions. [2025-03-03 10:42:33,809 INFO L78 Accepts]: Start accepts. Automaton has 75153 states and 81390 transitions. Word has length 466 [2025-03-03 10:42:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:33,809 INFO L471 AbstractCegarLoop]: Abstraction has 75153 states and 81390 transitions. [2025-03-03 10:42:33,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:33,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75153 states and 81390 transitions. [2025-03-03 10:42:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-03 10:42:33,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:33,818 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:42:33,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:42:34,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:42:34,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:34,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:34,022 INFO L85 PathProgramCache]: Analyzing trace with hash -885521267, now seen corresponding path program 1 times [2025-03-03 10:42:34,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:34,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996484869] [2025-03-03 10:42:34,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:34,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:42:34,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:42:34,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:34,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-03 10:42:34,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:34,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996484869] [2025-03-03 10:42:34,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996484869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:34,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:34,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:34,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966320344] [2025-03-03 10:42:34,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:34,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:34,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:34,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:34,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:34,308 INFO L87 Difference]: Start difference. First operand 75153 states and 81390 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:37,154 INFO L93 Difference]: Finished difference Result 164471 states and 179010 transitions. [2025-03-03 10:42:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 484 [2025-03-03 10:42:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:37,251 INFO L225 Difference]: With dead ends: 164471 [2025-03-03 10:42:37,251 INFO L226 Difference]: Without dead ends: 88533 [2025-03-03 10:42:37,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:37,283 INFO L435 NwaCegarLoop]: 1702 mSDtfsCounter, 725 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:37,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1838 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 2487 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:42:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88533 states. [2025-03-03 10:42:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88533 to 88520. [2025-03-03 10:42:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88520 states, 88519 states have (on average 1.071611744371265) internal successors, (94858), 88519 states have internal predecessors, (94858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:38,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88520 states to 88520 states and 94858 transitions. [2025-03-03 10:42:38,045 INFO L78 Accepts]: Start accepts. Automaton has 88520 states and 94858 transitions. Word has length 484 [2025-03-03 10:42:38,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:38,046 INFO L471 AbstractCegarLoop]: Abstraction has 88520 states and 94858 transitions. [2025-03-03 10:42:38,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 88520 states and 94858 transitions. [2025-03-03 10:42:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 10:42:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:38,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:42:38,061 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1136340049, now seen corresponding path program 1 times [2025-03-03 10:42:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665646740] [2025-03-03 10:42:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:38,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 10:42:38,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 10:42:38,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:38,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:38,536 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:42:38,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:38,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665646740] [2025-03-03 10:42:38,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665646740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:38,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853032527] [2025-03-03 10:42:38,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:38,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:42:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:42:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:38,537 INFO L87 Difference]: Start difference. First operand 88520 states and 94858 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:41,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:41,796 INFO L93 Difference]: Finished difference Result 185696 states and 198890 transitions. [2025-03-03 10:42:41,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:42:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 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 597 [2025-03-03 10:42:41,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:41,900 INFO L225 Difference]: With dead ends: 185696 [2025-03-03 10:42:41,900 INFO L226 Difference]: Without dead ends: 96389 [2025-03-03 10:42:41,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:42:41,954 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 1465 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 4045 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 4045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:41,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 951 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 4045 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:42:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96389 states. [2025-03-03 10:42:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96389 to 94814. [2025-03-03 10:42:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94814 states, 94813 states have (on average 1.0649805406431607) internal successors, (100974), 94813 states have internal predecessors, (100974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94814 states to 94814 states and 100974 transitions. [2025-03-03 10:42:42,901 INFO L78 Accepts]: Start accepts. Automaton has 94814 states and 100974 transitions. Word has length 597 [2025-03-03 10:42:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:42,901 INFO L471 AbstractCegarLoop]: Abstraction has 94814 states and 100974 transitions. [2025-03-03 10:42:42,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:42,901 INFO L276 IsEmpty]: Start isEmpty. Operand 94814 states and 100974 transitions. [2025-03-03 10:42:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-03 10:42:42,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:42,921 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:42,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:42:42,922 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 623454209, now seen corresponding path program 1 times [2025-03-03 10:42:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:42,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053043497] [2025-03-03 10:42:42,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:42,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-03 10:42:42,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-03 10:42:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 459 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-03 10:42:43,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:43,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053043497] [2025-03-03 10:42:43,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053043497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:43,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:43,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:42:43,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235517555] [2025-03-03 10:42:43,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:43,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:43,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:43,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:43,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:43,415 INFO L87 Difference]: Start difference. First operand 94814 states and 100974 transitions. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:46,175 INFO L93 Difference]: Finished difference Result 204596 states and 217664 transitions. [2025-03-03 10:42:46,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:46,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 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 657 [2025-03-03 10:42:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:46,306 INFO L225 Difference]: With dead ends: 204596 [2025-03-03 10:42:46,307 INFO L226 Difference]: Without dead ends: 110571 [2025-03-03 10:42:46,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:46,360 INFO L435 NwaCegarLoop]: 914 mSDtfsCounter, 574 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:46,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [574 Valid, 1074 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:42:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110571 states. [2025-03-03 10:42:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110571 to 109774. [2025-03-03 10:42:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109774 states, 109773 states have (on average 1.0603427072230875) internal successors, (116397), 109773 states have internal predecessors, (116397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109774 states to 109774 states and 116397 transitions. [2025-03-03 10:42:47,636 INFO L78 Accepts]: Start accepts. Automaton has 109774 states and 116397 transitions. Word has length 657 [2025-03-03 10:42:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:47,637 INFO L471 AbstractCegarLoop]: Abstraction has 109774 states and 116397 transitions. [2025-03-03 10:42:47,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 2 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 109774 states and 116397 transitions. [2025-03-03 10:42:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-03-03 10:42:47,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:47,656 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:47,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:42:47,656 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 194645500, now seen corresponding path program 1 times [2025-03-03 10:42:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813567320] [2025-03-03 10:42:47,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:47,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-03-03 10:42:47,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-03-03 10:42:47,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:47,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:48,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1090 backedges. 895 proven. 0 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2025-03-03 10:42:48,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:48,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813567320] [2025-03-03 10:42:48,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813567320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:48,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:48,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:48,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968198238] [2025-03-03 10:42:48,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:48,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:48,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:48,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:48,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:48,353 INFO L87 Difference]: Start difference. First operand 109774 states and 116397 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:42:51,022 INFO L93 Difference]: Finished difference Result 219550 states and 232804 transitions. [2025-03-03 10:42:51,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:42:51,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 730 [2025-03-03 10:42:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:42:51,135 INFO L225 Difference]: With dead ends: 219550 [2025-03-03 10:42:51,135 INFO L226 Difference]: Without dead ends: 108986 [2025-03-03 10:42:51,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:51,179 INFO L435 NwaCegarLoop]: 1592 mSDtfsCounter, 625 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:42:51,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 1720 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:42:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108986 states. [2025-03-03 10:42:52,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108986 to 107396. [2025-03-03 10:42:52,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107396 states, 107395 states have (on average 1.049006005866195) internal successors, (112658), 107395 states have internal predecessors, (112658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107396 states to 107396 states and 112658 transitions. [2025-03-03 10:42:52,189 INFO L78 Accepts]: Start accepts. Automaton has 107396 states and 112658 transitions. Word has length 730 [2025-03-03 10:42:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:42:52,189 INFO L471 AbstractCegarLoop]: Abstraction has 107396 states and 112658 transitions. [2025-03-03 10:42:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:42:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 107396 states and 112658 transitions. [2025-03-03 10:42:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 780 [2025-03-03 10:42:52,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:42:52,210 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:42:52,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:42:52,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:42:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:42:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 846659008, now seen corresponding path program 1 times [2025-03-03 10:42:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:42:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876068754] [2025-03-03 10:42:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:42:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:42:52,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 779 statements into 1 equivalence classes. [2025-03-03 10:42:52,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 779 of 779 statements. [2025-03-03 10:42:52,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:42:52,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:42:52,863 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2025-03-03 10:42:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:42:52,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876068754] [2025-03-03 10:42:52,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876068754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:42:52,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:42:52,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:42:52,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874163431] [2025-03-03 10:42:52,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:42:52,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:42:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:42:52,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:42:52,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:42:52,865 INFO L87 Difference]: Start difference. First operand 107396 states and 112658 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)