./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label31.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/Problem16_label31.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 030ee26298bd2420f8f616fb27ee842ae3e86a11841315b0a84bebf89a7dcbb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:55:20,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:55:20,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:55:20,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:55:20,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:55:20,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:55:20,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:55:20,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:55:20,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:55:20,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:55:20,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:55:20,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:55:20,568 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:55:20,568 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:55:20,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:55:20,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:55:20,569 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:55:20,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:20,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:55:20,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:55:20,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:55:20,572 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 -> 030ee26298bd2420f8f616fb27ee842ae3e86a11841315b0a84bebf89a7dcbb5 [2025-03-03 10:55:20,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:55:20,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:55:20,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:55:20,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:55:20,801 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:55:20,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label31.c [2025-03-03 10:55:21,958 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e9c387c/dba8ac4a2f804cf99d9e7097820b21c5/FLAGd99460995 [2025-03-03 10:55:22,376 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:55:22,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label31.c [2025-03-03 10:55:22,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e9c387c/dba8ac4a2f804cf99d9e7097820b21c5/FLAGd99460995 [2025-03-03 10:55:22,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e9c387c/dba8ac4a2f804cf99d9e7097820b21c5 [2025-03-03 10:55:22,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:55:22,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:55:22,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:22,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:55:22,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:55:22,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:22" (1/1) ... [2025-03-03 10:55:22,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5069a45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:22, skipping insertion in model container [2025-03-03 10:55:22,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:55:22" (1/1) ... [2025-03-03 10:55:22,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:55:22,595 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/Problem16_label31.c[1200,1213] [2025-03-03 10:55:22,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:22,875 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:55:22,883 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/Problem16_label31.c[1200,1213] [2025-03-03 10:55:22,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:55:23,011 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:55:23,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23 WrapperNode [2025-03-03 10:55:23,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:55:23,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:23,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:55:23,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:55:23,019 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:55:23" (1/1) ... [2025-03-03 10:55:23,044 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:55:23" (1/1) ... [2025-03-03 10:55:23,161 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:55:23,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:55:23,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:55:23,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:55:23,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:55:23,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,236 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:55:23,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:55:23,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:55:23,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:55:23,304 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:55:23,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (1/1) ... [2025-03-03 10:55:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:55:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:23,331 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:55:23,334 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:55:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:55:23,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:55:23,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:55:23,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:55:23,408 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:55:23,409 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:55:24,949 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:55:25,020 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:55:25,020 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:55:25,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:55:25,041 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:55:25,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:25 BoogieIcfgContainer [2025-03-03 10:55:25,042 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:55:25,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:55:25,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:55:25,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:55:25,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:55:22" (1/3) ... [2025-03-03 10:55:25,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:25, skipping insertion in model container [2025-03-03 10:55:25,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:55:23" (2/3) ... [2025-03-03 10:55:25,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:55:25, skipping insertion in model container [2025-03-03 10:55:25,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:55:25" (3/3) ... [2025-03-03 10:55:25,049 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label31.c [2025-03-03 10:55:25,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:55:25,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label31.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:55:25,118 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:55:25,128 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;@138df0e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:55:25,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:55:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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:55:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 10:55:25,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:25,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:25,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:25,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash -251619717, now seen corresponding path program 1 times [2025-03-03 10:55:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937469755] [2025-03-03 10:55:25,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:25,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 10:55:25,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 10:55:25,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:25,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:25,287 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:55:25,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:25,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937469755] [2025-03-03 10:55:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937469755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:25,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898982675] [2025-03-03 10:55:25,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:25,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:25,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:25,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:25,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:25,315 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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:55:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:26,615 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-03-03 10:55:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-03 10:55:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:26,632 INFO L225 Difference]: With dead ends: 1137 [2025-03-03 10:55:26,632 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:55:26,636 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:55:26,639 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 378 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:26,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 60 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:55:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:55:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:55:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7639939485627836) internal successors, (1166), 661 states have internal predecessors, (1166), 0 states have call successors, (0), 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:55:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1166 transitions. [2025-03-03 10:55:26,686 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1166 transitions. Word has length 8 [2025-03-03 10:55:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:26,687 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1166 transitions. [2025-03-03 10:55:26,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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:55:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1166 transitions. [2025-03-03 10:55:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 10:55:26,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:26,690 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:55:26,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:55:26,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:26,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:26,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1864769742, now seen corresponding path program 1 times [2025-03-03 10:55:26,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:26,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002437814] [2025-03-03 10:55:26,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:26,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 10:55:26,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 10:55:26,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:26,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:26,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:26,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002437814] [2025-03-03 10:55:26,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002437814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:26,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883103814] [2025-03-03 10:55:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:26,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:26,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:26,934 INFO L87 Difference]: Start difference. First operand 662 states and 1166 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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:55:28,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:28,013 INFO L93 Difference]: Finished difference Result 1980 states and 3493 transitions. [2025-03-03 10:55:28,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:28,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 10:55:28,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:28,018 INFO L225 Difference]: With dead ends: 1980 [2025-03-03 10:55:28,018 INFO L226 Difference]: Without dead ends: 1320 [2025-03-03 10:55:28,019 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:55:28,020 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 344 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:28,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:55:28,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-03 10:55:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-03 10:55:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.6656557998483699) internal successors, (2197), 1319 states have internal predecessors, (2197), 0 states have call successors, (0), 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:55:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2197 transitions. [2025-03-03 10:55:28,062 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2197 transitions. Word has length 73 [2025-03-03 10:55:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:28,062 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2197 transitions. [2025-03-03 10:55:28,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 2 states have internal predecessors, (73), 0 states have call successors, (0), 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:55:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2197 transitions. [2025-03-03 10:55:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 10:55:28,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:28,064 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:55:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:55:28,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:28,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -4994233, now seen corresponding path program 1 times [2025-03-03 10:55:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173977504] [2025-03-03 10:55:28,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:28,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 10:55:28,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 10:55:28,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:28,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:28,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:28,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173977504] [2025-03-03 10:55:28,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173977504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:28,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:28,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522952271] [2025-03-03 10:55:28,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:28,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:28,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:28,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:28,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:28,282 INFO L87 Difference]: Start difference. First operand 1320 states and 2197 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:55:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:29,857 INFO L93 Difference]: Finished difference Result 3625 states and 5926 transitions. [2025-03-03 10:55:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:55:29,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-03-03 10:55:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:29,865 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:55:29,865 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:55:29,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:29,867 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 1005 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 523 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 523 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:29,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 41 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [523 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:55:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:55:29,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:55:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.5034692107545533) internal successors, (3467), 2306 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:55:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3467 transitions. [2025-03-03 10:55:29,901 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3467 transitions. Word has length 76 [2025-03-03 10:55:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3467 transitions. [2025-03-03 10:55:29,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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:55:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3467 transitions. [2025-03-03 10:55:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 10:55:29,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:29,904 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:55:29,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:55:29,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:29,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:29,904 INFO L85 PathProgramCache]: Analyzing trace with hash 376027671, now seen corresponding path program 1 times [2025-03-03 10:55:29,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:29,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208774517] [2025-03-03 10:55:29,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:29,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:29,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 10:55:29,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 10:55:29,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:55:30,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208774517] [2025-03-03 10:55:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208774517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:30,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:30,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209817295] [2025-03-03 10:55:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:30,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:30,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:30,015 INFO L87 Difference]: Start difference. First operand 2307 states and 3467 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:31,037 INFO L93 Difference]: Finished difference Result 6257 states and 9726 transitions. [2025-03-03 10:55:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 95 [2025-03-03 10:55:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:31,050 INFO L225 Difference]: With dead ends: 6257 [2025-03-03 10:55:31,050 INFO L226 Difference]: Without dead ends: 4281 [2025-03-03 10:55:31,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:31,056 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 270 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:31,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:55:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-03 10:55:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-03 10:55:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.3539719626168225) internal successors, (5795), 4280 states have internal predecessors, (5795), 0 states have call successors, (0), 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:55:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5795 transitions. [2025-03-03 10:55:31,128 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5795 transitions. Word has length 95 [2025-03-03 10:55:31,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:31,129 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5795 transitions. [2025-03-03 10:55:31,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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:55:31,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5795 transitions. [2025-03-03 10:55:31,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 10:55:31,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:31,135 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:31,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:55:31,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:31,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:31,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1635936291, now seen corresponding path program 1 times [2025-03-03 10:55:31,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:31,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801641504] [2025-03-03 10:55:31,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:31,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 10:55:31,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 10:55:31,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:31,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:31,318 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:55:31,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:31,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801641504] [2025-03-03 10:55:31,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801641504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:31,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:31,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780931869] [2025-03-03 10:55:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:31,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:31,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:31,320 INFO L87 Difference]: Start difference. First operand 4281 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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:55:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:32,209 INFO L93 Difference]: Finished difference Result 9547 states and 12996 transitions. [2025-03-03 10:55:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-03 10:55:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:32,224 INFO L225 Difference]: With dead ends: 9547 [2025-03-03 10:55:32,224 INFO L226 Difference]: Without dead ends: 5597 [2025-03-03 10:55:32,229 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:55:32,230 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 280 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:32,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 546 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:55:32,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2025-03-03 10:55:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2025-03-03 10:55:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.2975339528234453) internal successors, (7261), 5596 states have internal predecessors, (7261), 0 states have call successors, (0), 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:55:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 7261 transitions. [2025-03-03 10:55:32,308 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 7261 transitions. Word has length 191 [2025-03-03 10:55:32,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:32,309 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 7261 transitions. [2025-03-03 10:55:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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:55:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 7261 transitions. [2025-03-03 10:55:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 10:55:32,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:32,312 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:32,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:55:32,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:32,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:32,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1038276448, now seen corresponding path program 1 times [2025-03-03 10:55:32,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:32,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801323921] [2025-03-03 10:55:32,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:32,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 10:55:32,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 10:55:32,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:32,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:55:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801323921] [2025-03-03 10:55:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801323921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:32,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:32,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447403491] [2025-03-03 10:55:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:32,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:32,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:32,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:32,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:32,525 INFO L87 Difference]: Start difference. First operand 5597 states and 7261 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:55:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:33,364 INFO L93 Difference]: Finished difference Result 14153 states and 18437 transitions. [2025-03-03 10:55:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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 275 [2025-03-03 10:55:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:33,380 INFO L225 Difference]: With dead ends: 14153 [2025-03-03 10:55:33,380 INFO L226 Difference]: Without dead ends: 7571 [2025-03-03 10:55:33,387 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:55:33,387 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:33,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:55:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-03 10:55:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 6584. [2025-03-03 10:55:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.0742822421388425) internal successors, (7072), 6583 states have internal predecessors, (7072), 0 states have call successors, (0), 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:55:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 7072 transitions. [2025-03-03 10:55:33,486 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 7072 transitions. Word has length 275 [2025-03-03 10:55:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:33,486 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 7072 transitions. [2025-03-03 10:55:33,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 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:55:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 7072 transitions. [2025-03-03 10:55:33,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-03 10:55:33,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:33,489 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:33,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:55:33,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:33,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1901672597, now seen corresponding path program 1 times [2025-03-03 10:55:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624918898] [2025-03-03 10:55:33,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:33,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:33,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-03 10:55:33,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-03 10:55:33,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:33,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:55:33,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:33,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624918898] [2025-03-03 10:55:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624918898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704962193] [2025-03-03 10:55:33,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:33,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:33,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:33,839 INFO L87 Difference]: Start difference. First operand 6584 states and 7072 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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:55:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:34,579 INFO L93 Difference]: Finished difference Result 15798 states and 17037 transitions. [2025-03-03 10:55:34,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:34,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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 339 [2025-03-03 10:55:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:34,606 INFO L225 Difference]: With dead ends: 15798 [2025-03-03 10:55:34,606 INFO L226 Difference]: Without dead ends: 9545 [2025-03-03 10:55:34,612 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:55:34,612 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:34,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 43 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:34,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-03-03 10:55:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2025-03-03 10:55:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.073658843252305) internal successors, (10247), 9544 states have internal predecessors, (10247), 0 states have call successors, (0), 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:55:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10247 transitions. [2025-03-03 10:55:34,713 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 10247 transitions. Word has length 339 [2025-03-03 10:55:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:34,714 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 10247 transitions. [2025-03-03 10:55:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 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:55:34,714 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 10247 transitions. [2025-03-03 10:55:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-03 10:55:34,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:34,719 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:34,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:55:34,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:34,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -562392745, now seen corresponding path program 1 times [2025-03-03 10:55:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:34,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329857619] [2025-03-03 10:55:34,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:34,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:34,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-03 10:55:34,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-03 10:55:34,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:34,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:34,961 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-03 10:55:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329857619] [2025-03-03 10:55:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329857619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:34,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:34,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670325417] [2025-03-03 10:55:34,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:34,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:34,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:34,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:34,963 INFO L87 Difference]: Start difference. First operand 9545 states and 10247 transitions. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:55:35,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:35,716 INFO L93 Difference]: Finished difference Result 22049 states and 23760 transitions. [2025-03-03 10:55:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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 347 [2025-03-03 10:55:35,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:35,735 INFO L225 Difference]: With dead ends: 22049 [2025-03-03 10:55:35,736 INFO L226 Difference]: Without dead ends: 13164 [2025-03-03 10:55:35,743 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:55:35,744 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 340 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:35,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 38 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-03-03 10:55:35,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 11519. [2025-03-03 10:55:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.071279736065289) internal successors, (12339), 11518 states have internal predecessors, (12339), 0 states have call successors, (0), 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:55:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12339 transitions. [2025-03-03 10:55:35,863 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12339 transitions. Word has length 347 [2025-03-03 10:55:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:35,863 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12339 transitions. [2025-03-03 10:55:35,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 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:55:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12339 transitions. [2025-03-03 10:55:35,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2025-03-03 10:55:35,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:35,867 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:35,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:55:35,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:35,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:35,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1497101552, now seen corresponding path program 1 times [2025-03-03 10:55:35,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:35,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801818697] [2025-03-03 10:55:35,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:35,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 401 statements into 1 equivalence classes. [2025-03-03 10:55:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 401 of 401 statements. [2025-03-03 10:55:35,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2025-03-03 10:55:36,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:36,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801818697] [2025-03-03 10:55:36,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801818697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:36,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:36,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:36,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230632171] [2025-03-03 10:55:36,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:36,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:36,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:36,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:36,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:36,154 INFO L87 Difference]: Start difference. First operand 11519 states and 12339 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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:55:36,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:36,844 INFO L93 Difference]: Finished difference Result 25339 states and 27199 transitions. [2025-03-03 10:55:36,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:36,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 401 [2025-03-03 10:55:36,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:36,865 INFO L225 Difference]: With dead ends: 25339 [2025-03-03 10:55:36,865 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:55:36,874 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:55:36,875 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 326 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:36,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 434 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:55:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-03 10:55:37,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0638159322769698) internal successors, (14703), 13821 states have internal predecessors, (14703), 0 states have call successors, (0), 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:55:37,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14703 transitions. [2025-03-03 10:55:37,033 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14703 transitions. Word has length 401 [2025-03-03 10:55:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:37,034 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14703 transitions. [2025-03-03 10:55:37,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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:55:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14703 transitions. [2025-03-03 10:55:37,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-03 10:55:37,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:37,039 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:55:37,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:55:37,040 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:37,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash -284202909, now seen corresponding path program 1 times [2025-03-03 10:55:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:37,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846345582] [2025-03-03 10:55:37,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:37,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-03 10:55:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-03 10:55:37,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:37,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2025-03-03 10:55:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846345582] [2025-03-03 10:55:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846345582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963491231] [2025-03-03 10:55:37,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:37,447 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:55:37,448 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:55:37,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-03 10:55:37,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-03 10:55:37,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:37,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:37,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:37,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 10:55:38,045 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963491231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:55:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006376419] [2025-03-03 10:55:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:38,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:38,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:38,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:38,046 INFO L87 Difference]: Start difference. First operand 13822 states and 14703 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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:55:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:38,578 INFO L93 Difference]: Finished difference Result 15798 states and 16729 transitions. [2025-03-03 10:55:38,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:38,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 462 [2025-03-03 10:55:38,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:38,600 INFO L225 Difference]: With dead ends: 15798 [2025-03-03 10:55:38,600 INFO L226 Difference]: Without dead ends: 15796 [2025-03-03 10:55:38,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 461 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:38,607 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:38,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 75 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15796 states. [2025-03-03 10:55:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15796 to 14151. [2025-03-03 10:55:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0629681978798586) internal successors, (15041), 14150 states have internal predecessors, (15041), 0 states have call successors, (0), 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:55:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 15041 transitions. [2025-03-03 10:55:38,820 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 15041 transitions. Word has length 462 [2025-03-03 10:55:38,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:38,820 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 15041 transitions. [2025-03-03 10:55:38,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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:55:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 15041 transitions. [2025-03-03 10:55:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1184 [2025-03-03 10:55:38,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:38,865 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:55:38,872 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:55:39,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 10:55:39,067 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:39,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1276306719, now seen corresponding path program 1 times [2025-03-03 10:55:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834824105] [2025-03-03 10:55:39,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1183 statements into 1 equivalence classes. [2025-03-03 10:55:39,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1183 of 1183 statements. [2025-03-03 10:55:39,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1319 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2025-03-03 10:55:40,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:40,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834824105] [2025-03-03 10:55:40,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834824105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:40,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:40,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:55:40,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772245940] [2025-03-03 10:55:40,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:40,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:40,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:40,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:40,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:40,015 INFO L87 Difference]: Start difference. First operand 14151 states and 15041 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 2 states have internal predecessors, (522), 0 states have call successors, (0), 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:55:40,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:40,589 INFO L93 Difference]: Finished difference Result 28300 states and 30086 transitions. [2025-03-03 10:55:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 2 states have internal predecessors, (522), 0 states have call successors, (0), 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 1183 [2025-03-03 10:55:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:40,607 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:55:40,608 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:55:40,618 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:55:40,619 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:40,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 102 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:55:40,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-03 10:55:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0620208577940466) internal successors, (15377), 14479 states have internal predecessors, (15377), 0 states have call successors, (0), 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:55:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15377 transitions. [2025-03-03 10:55:40,736 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15377 transitions. Word has length 1183 [2025-03-03 10:55:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:40,738 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15377 transitions. [2025-03-03 10:55:40,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 2 states have internal predecessors, (522), 0 states have call successors, (0), 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:55:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15377 transitions. [2025-03-03 10:55:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1192 [2025-03-03 10:55:40,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:40,753 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:55:40,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:55:40,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:40,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:40,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1301314867, now seen corresponding path program 1 times [2025-03-03 10:55:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:40,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166782436] [2025-03-03 10:55:40,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:40,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:40,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1191 statements into 1 equivalence classes. [2025-03-03 10:55:40,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1191 of 1191 statements. [2025-03-03 10:55:40,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:40,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1635 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2025-03-03 10:55:41,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:41,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166782436] [2025-03-03 10:55:41,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166782436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:41,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:41,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:41,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038577309] [2025-03-03 10:55:41,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:41,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:41,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:41,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:41,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:41,310 INFO L87 Difference]: Start difference. First operand 14480 states and 15377 transitions. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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:55:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:41,937 INFO L93 Difference]: Finished difference Result 28300 states and 30085 transitions. [2025-03-03 10:55:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:41,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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 1191 [2025-03-03 10:55:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:41,952 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:55:41,953 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:55:41,963 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:55:41,963 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:41,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 427 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:55:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14151. [2025-03-03 10:55:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0453710247349823) internal successors, (14792), 14150 states have internal predecessors, (14792), 0 states have call successors, (0), 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:55:42,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14792 transitions. [2025-03-03 10:55:42,116 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14792 transitions. Word has length 1191 [2025-03-03 10:55:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14792 transitions. [2025-03-03 10:55:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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:55:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14792 transitions. [2025-03-03 10:55:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1193 [2025-03-03 10:55:42,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:42,138 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:55:42,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:55:42,139 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:42,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1770076225, now seen corresponding path program 1 times [2025-03-03 10:55:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936633488] [2025-03-03 10:55:42,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:42,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1192 statements into 1 equivalence classes. [2025-03-03 10:55:42,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1192 of 1192 statements. [2025-03-03 10:55:42,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:42,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:43,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2273 backedges. 1607 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-03 10:55:43,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:43,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936633488] [2025-03-03 10:55:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936633488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:43,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:43,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:55:43,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231034628] [2025-03-03 10:55:43,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:43,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:55:43,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:43,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:55:43,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:55:43,163 INFO L87 Difference]: Start difference. First operand 14151 states and 14792 transitions. Second operand has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 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:55:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:44,217 INFO L93 Difference]: Finished difference Result 28301 states and 29596 transitions. [2025-03-03 10:55:44,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:55:44,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 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 1192 [2025-03-03 10:55:44,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:44,229 INFO L225 Difference]: With dead ends: 28301 [2025-03-03 10:55:44,229 INFO L226 Difference]: Without dead ends: 14810 [2025-03-03 10:55:44,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:44,236 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 209 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 2349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:44,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 572 Invalid, 2349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:55:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14810 states. [2025-03-03 10:55:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14810 to 14809. [2025-03-03 10:55:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0436925985953538) internal successors, (15455), 14808 states have internal predecessors, (15455), 0 states have call successors, (0), 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:55:44,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15455 transitions. [2025-03-03 10:55:44,342 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15455 transitions. Word has length 1192 [2025-03-03 10:55:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:44,343 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15455 transitions. [2025-03-03 10:55:44,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 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:55:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15455 transitions. [2025-03-03 10:55:44,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1207 [2025-03-03 10:55:44,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:44,357 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 3, 3, 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] [2025-03-03 10:55:44,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:55:44,358 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:44,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1675317992, now seen corresponding path program 1 times [2025-03-03 10:55:44,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:44,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585894733] [2025-03-03 10:55:44,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:44,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:44,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1206 statements into 1 equivalence classes. [2025-03-03 10:55:44,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1206 of 1206 statements. [2025-03-03 10:55:44,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:44,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2258 backedges. 1629 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2025-03-03 10:55:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585894733] [2025-03-03 10:55:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585894733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652792517] [2025-03-03 10:55:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:45,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:45,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:45,585 INFO L87 Difference]: Start difference. First operand 14809 states and 15455 transitions. Second operand has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 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:55:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:46,309 INFO L93 Difference]: Finished difference Result 28968 states and 30251 transitions. [2025-03-03 10:55:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:55:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 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 1206 [2025-03-03 10:55:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:46,323 INFO L225 Difference]: With dead ends: 28968 [2025-03-03 10:55:46,323 INFO L226 Difference]: Without dead ends: 14819 [2025-03-03 10:55:46,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:46,332 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:46,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:55:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14819 states. [2025-03-03 10:55:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14819 to 14480. [2025-03-03 10:55:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0439256854755163) internal successors, (15115), 14479 states have internal predecessors, (15115), 0 states have call successors, (0), 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:55:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15115 transitions. [2025-03-03 10:55:46,448 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15115 transitions. Word has length 1206 [2025-03-03 10:55:46,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:46,449 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15115 transitions. [2025-03-03 10:55:46,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.5) internal successors, (770), 4 states have internal predecessors, (770), 0 states have call successors, (0), 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:55:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15115 transitions. [2025-03-03 10:55:46,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2025-03-03 10:55:46,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:46,464 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:55:46,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:55:46,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:46,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:46,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1506772154, now seen corresponding path program 1 times [2025-03-03 10:55:46,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:46,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687180405] [2025-03-03 10:55:46,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:46,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:46,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-03-03 10:55:46,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-03-03 10:55:46,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:46,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2514 backedges. 1715 proven. 0 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-03-03 10:55:47,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:47,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687180405] [2025-03-03 10:55:47,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687180405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:47,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:55:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772209133] [2025-03-03 10:55:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:47,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:55:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:47,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:55:47,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:55:47,343 INFO L87 Difference]: Start difference. First operand 14480 states and 15115 transitions. Second operand has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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:55:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:48,030 INFO L93 Difference]: Finished difference Result 28300 states and 29561 transitions. [2025-03-03 10:55:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:55:48,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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 1246 [2025-03-03 10:55:48,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:48,043 INFO L225 Difference]: With dead ends: 28300 [2025-03-03 10:55:48,044 INFO L226 Difference]: Without dead ends: 14480 [2025-03-03 10:55:48,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:55:48,052 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 120 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:48,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 563 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:48,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-03 10:55:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-03 10:55:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0430968989571103) internal successors, (15103), 14479 states have internal predecessors, (15103), 0 states have call successors, (0), 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:55:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15103 transitions. [2025-03-03 10:55:48,151 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15103 transitions. Word has length 1246 [2025-03-03 10:55:48,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:48,151 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15103 transitions. [2025-03-03 10:55:48,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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:55:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15103 transitions. [2025-03-03 10:55:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1259 [2025-03-03 10:55:48,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:48,165 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:55:48,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:55:48,166 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:48,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash 298022285, now seen corresponding path program 1 times [2025-03-03 10:55:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746717932] [2025-03-03 10:55:48,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:48,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1258 statements into 1 equivalence classes. [2025-03-03 10:55:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1258 of 1258 statements. [2025-03-03 10:55:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 1511 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-03-03 10:55:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:49,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746717932] [2025-03-03 10:55:49,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746717932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:49,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832275] [2025-03-03 10:55:49,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:49,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:49,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:49,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:49,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:49,032 INFO L87 Difference]: Start difference. First operand 14480 states and 15103 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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:55:49,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:49,560 INFO L93 Difference]: Finished difference Result 28958 states and 30207 transitions. [2025-03-03 10:55:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:49,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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 1258 [2025-03-03 10:55:49,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:49,574 INFO L225 Difference]: With dead ends: 28958 [2025-03-03 10:55:49,574 INFO L226 Difference]: Without dead ends: 15138 [2025-03-03 10:55:49,583 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:55:49,584 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 225 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:49,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 437 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-03-03 10:55:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15138. [2025-03-03 10:55:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0414877452599591) internal successors, (15765), 15137 states have internal predecessors, (15765), 0 states have call successors, (0), 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:55:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15765 transitions. [2025-03-03 10:55:49,693 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15765 transitions. Word has length 1258 [2025-03-03 10:55:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:49,694 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15765 transitions. [2025-03-03 10:55:49,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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:55:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15765 transitions. [2025-03-03 10:55:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1313 [2025-03-03 10:55:49,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:49,708 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:49,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:55:49,708 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:49,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:49,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1952347882, now seen corresponding path program 1 times [2025-03-03 10:55:49,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:49,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943267771] [2025-03-03 10:55:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:49,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:49,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1312 statements into 1 equivalence classes. [2025-03-03 10:55:49,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1312 of 1312 statements. [2025-03-03 10:55:49,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:49,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2870 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-03 10:55:50,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943267771] [2025-03-03 10:55:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943267771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:50,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:55:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:55:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749249664] [2025-03-03 10:55:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:50,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:50,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:55:50,396 INFO L87 Difference]: Start difference. First operand 15138 states and 15765 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:55:51,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:51,016 INFO L93 Difference]: Finished difference Result 30603 states and 31872 transitions. [2025-03-03 10:55:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:51,017 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 1312 [2025-03-03 10:55:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:51,028 INFO L225 Difference]: With dead ends: 30603 [2025-03-03 10:55:51,028 INFO L226 Difference]: Without dead ends: 14809 [2025-03-03 10:55:51,036 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:55:51,036 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 328 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:51,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 421 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:55:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-03 10:55:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14151. [2025-03-03 10:55:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0306713780918728) internal successors, (14584), 14150 states have internal predecessors, (14584), 0 states have call successors, (0), 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:55:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14584 transitions. [2025-03-03 10:55:51,126 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14584 transitions. Word has length 1312 [2025-03-03 10:55:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:51,127 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14584 transitions. [2025-03-03 10:55:51,127 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:55:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14584 transitions. [2025-03-03 10:55:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2025-03-03 10:55:51,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:51,139 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 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, 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, 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, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:51,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:55:51,139 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:51,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 863728792, now seen corresponding path program 1 times [2025-03-03 10:55:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:51,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662575848] [2025-03-03 10:55:51,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:51,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:51,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-03-03 10:55:51,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-03-03 10:55:51,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 2119 proven. 202 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-03 10:55:51,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662575848] [2025-03-03 10:55:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662575848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:51,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270549097] [2025-03-03 10:55:51,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:51,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:51,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:51,964 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:55:51,965 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:55:52,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1339 statements into 1 equivalence classes. [2025-03-03 10:55:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1339 of 1339 statements. [2025-03-03 10:55:52,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:52,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:52,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:55:52,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:52,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2825 backedges. 1637 proven. 0 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-03-03 10:55:52,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:55:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270549097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:55:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:55:52,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:55:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852244689] [2025-03-03 10:55:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:55:52,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:55:52,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:52,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:55:52,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:52,713 INFO L87 Difference]: Start difference. First operand 14151 states and 14584 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:55:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:55:53,229 INFO L93 Difference]: Finished difference Result 27642 states and 28499 transitions. [2025-03-03 10:55:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:55:53,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1339 [2025-03-03 10:55:53,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:55:53,241 INFO L225 Difference]: With dead ends: 27642 [2025-03-03 10:55:53,241 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:55:53,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1343 GetRequests, 1338 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:55:53,248 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:55:53,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:55:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:55:53,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-03 10:55:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0272049779321322) internal successors, (14197), 13821 states have internal predecessors, (14197), 0 states have call successors, (0), 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:55:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14197 transitions. [2025-03-03 10:55:53,342 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14197 transitions. Word has length 1339 [2025-03-03 10:55:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:55:53,342 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14197 transitions. [2025-03-03 10:55:53,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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:55:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14197 transitions. [2025-03-03 10:55:53,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1528 [2025-03-03 10:55:53,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:55:53,357 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:55:53,364 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:55:53,558 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,SelfDestructingSolverStorable17 [2025-03-03 10:55:53,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:55:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:55:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1170160678, now seen corresponding path program 1 times [2025-03-03 10:55:53,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:55:53,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796605803] [2025-03-03 10:55:53,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:53,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:55:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1527 statements into 1 equivalence classes. [2025-03-03 10:55:53,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1527 of 1527 statements. [2025-03-03 10:55:53,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:53,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 2481 proven. 66 refuted. 0 times theorem prover too weak. 1455 trivial. 0 not checked. [2025-03-03 10:55:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:55:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796605803] [2025-03-03 10:55:54,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796605803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:55:54,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566465564] [2025-03-03 10:55:54,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:55:54,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:55:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:55:54,611 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:55:54,612 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:55:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1527 statements into 1 equivalence classes. [2025-03-03 10:55:54,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1527 of 1527 statements. [2025-03-03 10:55:54,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:55:54,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:55:54,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1764 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:55:54,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:55:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 1969 proven. 201 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2025-03-03 10:55:56,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:55:59,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4002 backedges. 1969 proven. 201 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2025-03-03 10:55:59,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566465564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:55:59,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:55:59,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-03 10:55:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652388180] [2025-03-03 10:55:59,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:55:59,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:55:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:55:59,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:55:59,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:55:59,965 INFO L87 Difference]: Start difference. First operand 13822 states and 14197 transitions. Second operand has 9 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 8 states have internal predecessors, (1751), 0 states have call successors, (0), 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:56:03,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:03,533 INFO L93 Difference]: Finished difference Result 37183 states and 38225 transitions. [2025-03-03 10:56:03,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 10:56:03,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 8 states have internal predecessors, (1751), 0 states have call successors, (0), 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 1527 [2025-03-03 10:56:03,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:03,551 INFO L225 Difference]: With dead ends: 37183 [2025-03-03 10:56:03,551 INFO L226 Difference]: Without dead ends: 24021 [2025-03-03 10:56:03,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3064 GetRequests, 3049 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:56:03,559 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1498 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6834 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 7108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 6834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:03,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 95 Invalid, 7108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 6834 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 10:56:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2025-03-03 10:56:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 19086. [2025-03-03 10:56:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19086 states, 19085 states have (on average 1.026198585276395) internal successors, (19585), 19085 states have internal predecessors, (19585), 0 states have call successors, (0), 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:56:03,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19585 transitions. [2025-03-03 10:56:03,727 INFO L78 Accepts]: Start accepts. Automaton has 19086 states and 19585 transitions. Word has length 1527 [2025-03-03 10:56:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 19086 states and 19585 transitions. [2025-03-03 10:56:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 8 states have internal predecessors, (1751), 0 states have call successors, (0), 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:56:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 19086 states and 19585 transitions. [2025-03-03 10:56:03,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1558 [2025-03-03 10:56:03,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:03,747 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-03 10:56:03,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:03,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:03,948 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:03,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1184634099, now seen corresponding path program 1 times [2025-03-03 10:56:03,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:03,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091071170] [2025-03-03 10:56:03,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:03,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:04,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1557 statements into 1 equivalence classes. [2025-03-03 10:56:04,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1557 of 1557 statements. [2025-03-03 10:56:04,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:04,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:05,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4587 backedges. 2132 proven. 0 refuted. 0 times theorem prover too weak. 2455 trivial. 0 not checked. [2025-03-03 10:56:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091071170] [2025-03-03 10:56:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091071170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:05,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260176459] [2025-03-03 10:56:05,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:56:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:05,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:56:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:56:05,220 INFO L87 Difference]: Start difference. First operand 19086 states and 19585 transitions. Second operand has 4 states, 4 states have (on average 173.25) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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:56:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:06,062 INFO L93 Difference]: Finished difference Result 37841 states and 38837 transitions. [2025-03-03 10:56:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:56:06,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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 1557 [2025-03-03 10:56:06,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:06,078 INFO L225 Difference]: With dead ends: 37841 [2025-03-03 10:56:06,078 INFO L226 Difference]: Without dead ends: 19086 [2025-03-03 10:56:06,087 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:56:06,088 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 268 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:06,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 108 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:56:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-03-03 10:56:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 19086. [2025-03-03 10:56:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19086 states, 19085 states have (on average 1.0259365994236311) internal successors, (19580), 19085 states have internal predecessors, (19580), 0 states have call successors, (0), 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:56:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19086 states to 19086 states and 19580 transitions. [2025-03-03 10:56:06,294 INFO L78 Accepts]: Start accepts. Automaton has 19086 states and 19580 transitions. Word has length 1557 [2025-03-03 10:56:06,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:06,294 INFO L471 AbstractCegarLoop]: Abstraction has 19086 states and 19580 transitions. [2025-03-03 10:56:06,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.25) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 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:56:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19086 states and 19580 transitions. [2025-03-03 10:56:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1621 [2025-03-03 10:56:06,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:06,327 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 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, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-03 10:56:06,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:56:06,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:06,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 664364667, now seen corresponding path program 1 times [2025-03-03 10:56:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124521083] [2025-03-03 10:56:06,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1620 statements into 1 equivalence classes. [2025-03-03 10:56:06,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1620 of 1620 statements. [2025-03-03 10:56:06,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4829 backedges. 2818 proven. 0 refuted. 0 times theorem prover too weak. 2011 trivial. 0 not checked. [2025-03-03 10:56:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124521083] [2025-03-03 10:56:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124521083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:07,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:07,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608771493] [2025-03-03 10:56:07,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:07,636 INFO L87 Difference]: Start difference. First operand 19086 states and 19580 transitions. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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:56:08,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:08,277 INFO L93 Difference]: Finished difference Result 40473 states and 41537 transitions. [2025-03-03 10:56:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:08,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 1620 [2025-03-03 10:56:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:08,296 INFO L225 Difference]: With dead ends: 40473 [2025-03-03 10:56:08,296 INFO L226 Difference]: Without dead ends: 22047 [2025-03-03 10:56:08,309 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:56:08,310 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:08,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 56 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22047 states. [2025-03-03 10:56:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22047 to 20073. [2025-03-03 10:56:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20073 states, 20072 states have (on average 1.024910322837784) internal successors, (20572), 20072 states have internal predecessors, (20572), 0 states have call successors, (0), 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:56:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20073 states to 20073 states and 20572 transitions. [2025-03-03 10:56:08,489 INFO L78 Accepts]: Start accepts. Automaton has 20073 states and 20572 transitions. Word has length 1620 [2025-03-03 10:56:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:08,489 INFO L471 AbstractCegarLoop]: Abstraction has 20073 states and 20572 transitions. [2025-03-03 10:56:08,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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:56:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 20073 states and 20572 transitions. [2025-03-03 10:56:08,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1662 [2025-03-03 10:56:08,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:08,509 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:08,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:56:08,510 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:08,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash -235356609, now seen corresponding path program 1 times [2025-03-03 10:56:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:08,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621498597] [2025-03-03 10:56:08,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:08,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:08,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1661 statements into 1 equivalence classes. [2025-03-03 10:56:08,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1661 of 1661 statements. [2025-03-03 10:56:08,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:08,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:10,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5442 backedges. 3839 proven. 41 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2025-03-03 10:56:10,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621498597] [2025-03-03 10:56:10,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621498597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:10,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243065831] [2025-03-03 10:56:10,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:10,547 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:56:10,548 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:56:10,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1661 statements into 1 equivalence classes. [2025-03-03 10:56:10,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1661 of 1661 statements. [2025-03-03 10:56:10,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:10,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:10,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:10,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5442 backedges. 2497 proven. 0 refuted. 0 times theorem prover too weak. 2945 trivial. 0 not checked. [2025-03-03 10:56:11,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243065831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:11,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:11,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:56:11,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907702038] [2025-03-03 10:56:11,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:11,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:11,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:11,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:11,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:11,249 INFO L87 Difference]: Start difference. First operand 20073 states and 20572 transitions. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:56:11,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:11,800 INFO L93 Difference]: Finished difference Result 39815 states and 40811 transitions. [2025-03-03 10:56:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:11,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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 1661 [2025-03-03 10:56:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:11,819 INFO L225 Difference]: With dead ends: 39815 [2025-03-03 10:56:11,819 INFO L226 Difference]: Without dead ends: 19744 [2025-03-03 10:56:11,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1665 GetRequests, 1661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:11,834 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:11,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 425 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-03-03 10:56:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19744. [2025-03-03 10:56:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.02390720761789) internal successors, (20215), 19743 states have internal predecessors, (20215), 0 states have call successors, (0), 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:56:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20215 transitions. [2025-03-03 10:56:11,984 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20215 transitions. Word has length 1661 [2025-03-03 10:56:11,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:11,985 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20215 transitions. [2025-03-03 10:56:11,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 0 states have call successors, (0), 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:56:11,985 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20215 transitions. [2025-03-03 10:56:12,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1726 [2025-03-03 10:56:12,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:12,005 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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] [2025-03-03 10:56:12,012 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:56:12,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:12,206 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:12,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:12,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1375201799, now seen corresponding path program 1 times [2025-03-03 10:56:12,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:12,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572003472] [2025-03-03 10:56:12,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:12,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:12,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1725 statements into 1 equivalence classes. [2025-03-03 10:56:12,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1725 of 1725 statements. [2025-03-03 10:56:12,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:12,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5143 backedges. 3626 proven. 115 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 10:56:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572003472] [2025-03-03 10:56:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572003472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420829912] [2025-03-03 10:56:13,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:13,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:13,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:13,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:13,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:56:13,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1725 statements into 1 equivalence classes. [2025-03-03 10:56:13,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1725 of 1725 statements. [2025-03-03 10:56:13,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:13,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 1982 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:56:13,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5143 backedges. 3626 proven. 115 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 10:56:14,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5143 backedges. 3626 proven. 115 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2025-03-03 10:56:15,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420829912] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:56:15,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:56:15,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-03 10:56:15,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676327718] [2025-03-03 10:56:15,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:56:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:56:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:15,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:56:15,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:15,999 INFO L87 Difference]: Start difference. First operand 19744 states and 20215 transitions. Second operand has 7 states, 7 states have (on average 144.42857142857142) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 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:56:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:17,607 INFO L93 Difference]: Finished difference Result 39486 states and 40436 transitions. [2025-03-03 10:56:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 10:56:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 144.42857142857142) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 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 1725 [2025-03-03 10:56:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:17,627 INFO L225 Difference]: With dead ends: 39486 [2025-03-03 10:56:17,627 INFO L226 Difference]: Without dead ends: 20402 [2025-03-03 10:56:17,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3455 GetRequests, 3448 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:56:17,639 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 825 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3668 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:17,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 107 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3668 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:56:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-03 10:56:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 17770. [2025-03-03 10:56:17,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17770 states, 17769 states have (on average 1.021216725758343) internal successors, (18146), 17769 states have internal predecessors, (18146), 0 states have call successors, (0), 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:56:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18146 transitions. [2025-03-03 10:56:17,815 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18146 transitions. Word has length 1725 [2025-03-03 10:56:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:17,816 INFO L471 AbstractCegarLoop]: Abstraction has 17770 states and 18146 transitions. [2025-03-03 10:56:17,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.42857142857142) internal successors, (1011), 6 states have internal predecessors, (1011), 0 states have call successors, (0), 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:56:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18146 transitions. [2025-03-03 10:56:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1781 [2025-03-03 10:56:17,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:17,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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] [2025-03-03 10:56:17,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:56:18,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 10:56:18,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:18,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:18,056 INFO L85 PathProgramCache]: Analyzing trace with hash -768575021, now seen corresponding path program 1 times [2025-03-03 10:56:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761646319] [2025-03-03 10:56:18,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:18,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1780 statements into 1 equivalence classes. [2025-03-03 10:56:18,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1780 of 1780 statements. [2025-03-03 10:56:18,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:18,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5319 backedges. 3147 proven. 1488 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 10:56:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761646319] [2025-03-03 10:56:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761646319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349150341] [2025-03-03 10:56:20,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:20,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:20,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:20,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:20,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:56:20,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1780 statements into 1 equivalence classes. [2025-03-03 10:56:20,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1780 of 1780 statements. [2025-03-03 10:56:20,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:20,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 2018 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:20,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5319 backedges. 3434 proven. 0 refuted. 0 times theorem prover too weak. 1885 trivial. 0 not checked. [2025-03-03 10:56:20,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349150341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:56:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543893724] [2025-03-03 10:56:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:20,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:20,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:20,997 INFO L87 Difference]: Start difference. First operand 17770 states and 18146 transitions. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 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:56:21,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:21,553 INFO L93 Difference]: Finished difference Result 37512 states and 38369 transitions. [2025-03-03 10:56:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:21,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 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 1780 [2025-03-03 10:56:21,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:21,571 INFO L225 Difference]: With dead ends: 37512 [2025-03-03 10:56:21,571 INFO L226 Difference]: Without dead ends: 20402 [2025-03-03 10:56:21,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1786 GetRequests, 1781 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:21,582 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 64 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:21,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 408 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:21,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-03 10:56:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 18099. [2025-03-03 10:56:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0180682948392088) internal successors, (18425), 18098 states have internal predecessors, (18425), 0 states have call successors, (0), 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:56:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18425 transitions. [2025-03-03 10:56:21,724 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18425 transitions. Word has length 1780 [2025-03-03 10:56:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:21,724 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18425 transitions. [2025-03-03 10:56:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 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:56:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18425 transitions. [2025-03-03 10:56:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1923 [2025-03-03 10:56:21,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:21,746 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:21,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:56:21,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:21,946 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:21,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:21,947 INFO L85 PathProgramCache]: Analyzing trace with hash 453047739, now seen corresponding path program 1 times [2025-03-03 10:56:21,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:21,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453611334] [2025-03-03 10:56:21,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:22,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1922 statements into 1 equivalence classes. [2025-03-03 10:56:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1922 of 1922 statements. [2025-03-03 10:56:22,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:24,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7099 backedges. 3900 proven. 576 refuted. 0 times theorem prover too weak. 2623 trivial. 0 not checked. [2025-03-03 10:56:24,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:24,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453611334] [2025-03-03 10:56:24,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453611334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:24,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784808890] [2025-03-03 10:56:24,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:24,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:24,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:24,474 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:24,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:56:24,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1922 statements into 1 equivalence classes. [2025-03-03 10:56:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1922 of 1922 statements. [2025-03-03 10:56:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:24,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 2224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:24,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7099 backedges. 3002 proven. 0 refuted. 0 times theorem prover too weak. 4097 trivial. 0 not checked. [2025-03-03 10:56:24,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784808890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:56:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171836857] [2025-03-03 10:56:24,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:24,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:24,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:24,975 INFO L87 Difference]: Start difference. First operand 18099 states and 18425 transitions. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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:56:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:25,556 INFO L93 Difference]: Finished difference Result 34222 states and 34842 transitions. [2025-03-03 10:56:25,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:25,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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 1922 [2025-03-03 10:56:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:25,570 INFO L225 Difference]: With dead ends: 34222 [2025-03-03 10:56:25,570 INFO L226 Difference]: Without dead ends: 16783 [2025-03-03 10:56:25,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1929 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:25,580 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 119 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:25,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 415 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-03 10:56:25,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2025-03-03 10:56:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0136455726373494) internal successors, (17011), 16782 states have internal predecessors, (17011), 0 states have call successors, (0), 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:56:25,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17011 transitions. [2025-03-03 10:56:25,691 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17011 transitions. Word has length 1922 [2025-03-03 10:56:25,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:25,691 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17011 transitions. [2025-03-03 10:56:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 0 states have call successors, (0), 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:56:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17011 transitions. [2025-03-03 10:56:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2334 [2025-03-03 10:56:25,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:25,719 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:25,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:25,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:25,919 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:25,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:25,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2069495639, now seen corresponding path program 1 times [2025-03-03 10:56:25,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:25,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263141592] [2025-03-03 10:56:25,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:25,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2333 statements into 1 equivalence classes. [2025-03-03 10:56:26,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2333 of 2333 statements. [2025-03-03 10:56:26,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:26,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10615 backedges. 7730 proven. 91 refuted. 0 times theorem prover too weak. 2794 trivial. 0 not checked. [2025-03-03 10:56:28,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263141592] [2025-03-03 10:56:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263141592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975651992] [2025-03-03 10:56:28,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:28,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:28,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:28,284 INFO L229 MonitoredProcess]: Starting monitored process 9 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:56:28,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:56:28,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2333 statements into 1 equivalence classes. [2025-03-03 10:56:28,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2333 of 2333 statements. [2025-03-03 10:56:28,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:28,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:28,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:28,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 10615 backedges. 3797 proven. 0 refuted. 0 times theorem prover too weak. 6818 trivial. 0 not checked. [2025-03-03 10:56:29,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975651992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:56:29,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397190154] [2025-03-03 10:56:29,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:29,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:29,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:29,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:29,401 INFO L87 Difference]: Start difference. First operand 16783 states and 17011 transitions. Second operand has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 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:56:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:30,059 INFO L93 Difference]: Finished difference Result 31919 states and 32364 transitions. [2025-03-03 10:56:30,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:30,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 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 2333 [2025-03-03 10:56:30,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:30,072 INFO L225 Difference]: With dead ends: 31919 [2025-03-03 10:56:30,072 INFO L226 Difference]: Without dead ends: 17112 [2025-03-03 10:56:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2338 GetRequests, 2333 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:30,080 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 119 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:30,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 420 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-03 10:56:30,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 16454. [2025-03-03 10:56:30,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0125812921655626) internal successors, (16660), 16453 states have internal predecessors, (16660), 0 states have call successors, (0), 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:56:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16660 transitions. [2025-03-03 10:56:30,222 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16660 transitions. Word has length 2333 [2025-03-03 10:56:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:30,222 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16660 transitions. [2025-03-03 10:56:30,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 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:56:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16660 transitions. [2025-03-03 10:56:30,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2512 [2025-03-03 10:56:30,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:30,253 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 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] [2025-03-03 10:56:30,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:56:30,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 10:56:30,454 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:30,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:30,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1509658832, now seen corresponding path program 1 times [2025-03-03 10:56:30,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:30,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795788391] [2025-03-03 10:56:30,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:30,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:30,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2511 statements into 1 equivalence classes. [2025-03-03 10:56:30,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2511 of 2511 statements. [2025-03-03 10:56:30,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 11973 backedges. 8315 proven. 153 refuted. 0 times theorem prover too weak. 3505 trivial. 0 not checked. [2025-03-03 10:56:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:33,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795788391] [2025-03-03 10:56:33,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795788391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858571579] [2025-03-03 10:56:33,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:33,277 INFO L229 MonitoredProcess]: Starting monitored process 10 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:56:33,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:56:33,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2511 statements into 1 equivalence classes. [2025-03-03 10:56:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2511 of 2511 statements. [2025-03-03 10:56:33,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:33,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:33,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 2855 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 10:56:33,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:34,883 INFO L134 CoverageAnalysis]: Checked inductivity of 11973 backedges. 5842 proven. 464 refuted. 0 times theorem prover too weak. 5667 trivial. 0 not checked. [2025-03-03 10:56:34,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 11973 backedges. 5842 proven. 464 refuted. 0 times theorem prover too weak. 5667 trivial. 0 not checked. [2025-03-03 10:56:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858571579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:56:36,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:56:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-03-03 10:56:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525350337] [2025-03-03 10:56:36,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:56:36,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 10:56:36,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:36,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 10:56:36,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-03 10:56:36,132 INFO L87 Difference]: Start difference. First operand 16454 states and 16660 transitions. Second operand has 12 states, 12 states have (on average 146.75) internal successors, (1761), 12 states have internal predecessors, (1761), 0 states have call successors, (0), 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:56:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:40,454 INFO L93 Difference]: Finished difference Result 33949 states and 34381 transitions. [2025-03-03 10:56:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 10:56:40,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 146.75) internal successors, (1761), 12 states have internal predecessors, (1761), 0 states have call successors, (0), 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 2511 [2025-03-03 10:56:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:40,472 INFO L225 Difference]: With dead ends: 33949 [2025-03-03 10:56:40,472 INFO L226 Difference]: Without dead ends: 19471 [2025-03-03 10:56:40,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5040 GetRequests, 5020 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2025-03-03 10:56:40,482 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1507 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13962 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 14170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 13962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:40,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 227 Invalid, 14170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 13962 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 10:56:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19471 states. [2025-03-03 10:56:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19471 to 18099. [2025-03-03 10:56:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0119350204442479) internal successors, (18314), 18098 states have internal predecessors, (18314), 0 states have call successors, (0), 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:56:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18314 transitions. [2025-03-03 10:56:40,619 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18314 transitions. Word has length 2511 [2025-03-03 10:56:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:40,620 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18314 transitions. [2025-03-03 10:56:40,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 146.75) internal successors, (1761), 12 states have internal predecessors, (1761), 0 states have call successors, (0), 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:56:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18314 transitions. [2025-03-03 10:56:40,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2538 [2025-03-03 10:56:40,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:40,652 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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:56:40,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 10:56:40,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 10:56:40,853 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:40,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1657341182, now seen corresponding path program 1 times [2025-03-03 10:56:40,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760043367] [2025-03-03 10:56:40,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:40,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2537 statements into 1 equivalence classes. [2025-03-03 10:56:41,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2537 of 2537 statements. [2025-03-03 10:56:41,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:41,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12854 backedges. 9533 proven. 737 refuted. 0 times theorem prover too weak. 2584 trivial. 0 not checked. [2025-03-03 10:56:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760043367] [2025-03-03 10:56:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760043367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102958346] [2025-03-03 10:56:44,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:44,226 INFO L229 MonitoredProcess]: Starting monitored process 11 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:56:44,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 10:56:44,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2537 statements into 1 equivalence classes.