./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label57.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label57.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 606add1ed9f1e0586ce8d6fd9687905298c8e4323967309eabbf0457b8710a5c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:04:29,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:04:29,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:04:29,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:04:29,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:04:29,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:04:29,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:04:29,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:04:29,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:04:29,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:04:29,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:04:29,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:04:29,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:04:29,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:04:29,276 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:04:29,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:04:29,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:04:29,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:04:29,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:04:29,278 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:04:29,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:04:29,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:04:29,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:04:29,278 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:04:29,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:04:29,279 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 -> 606add1ed9f1e0586ce8d6fd9687905298c8e4323967309eabbf0457b8710a5c [2025-03-16 15:04:29,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:04:29,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:04:29,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:04:29,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:04:29,510 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:04:29,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label57.c [2025-03-16 15:04:30,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492ba0f2e/055d58bd642b4907b5c157fd0e1574d1/FLAGf8beaf343 [2025-03-16 15:04:31,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:04:31,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c [2025-03-16 15:04:31,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492ba0f2e/055d58bd642b4907b5c157fd0e1574d1/FLAGf8beaf343 [2025-03-16 15:04:31,126 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492ba0f2e/055d58bd642b4907b5c157fd0e1574d1 [2025-03-16 15:04:31,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:04:31,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:04:31,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:04:31,131 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:04:31,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:04:31,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:31,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340f9b2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31, skipping insertion in model container [2025-03-16 15:04:31,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:31,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:04:31,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c[8676,8689] [2025-03-16 15:04:31,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:04:31,881 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:04:31,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label57.c[8676,8689] [2025-03-16 15:04:32,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:04:32,192 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:04:32,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32 WrapperNode [2025-03-16 15:04:32,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:04:32,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:04:32,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:04:32,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:04:32,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,554 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:04:32,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:04:32,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:04:32,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:04:32,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:04:32,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,869 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:04:32,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:32,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:33,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:33,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:33,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:33,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:04:33,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:04:33,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:04:33,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:04:33,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (1/1) ... [2025-03-16 15:04:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:04:33,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:33,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:04:33,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:04:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:04:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:04:33,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:04:33,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:04:33,358 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:04:33,359 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:04:37,288 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:04:37,290 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:04:37,290 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:04:37,436 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:04:37,437 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:04:37,462 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:04:37,466 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:04:37,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:04:37 BoogieIcfgContainer [2025-03-16 15:04:37,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:04:37,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:04:37,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:04:37,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:04:37,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:04:31" (1/3) ... [2025-03-16 15:04:37,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c32a686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:04:37, skipping insertion in model container [2025-03-16 15:04:37,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:32" (2/3) ... [2025-03-16 15:04:37,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c32a686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:04:37, skipping insertion in model container [2025-03-16 15:04:37,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:04:37" (3/3) ... [2025-03-16 15:04:37,475 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label57.c [2025-03-16 15:04:37,487 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:04:37,488 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label57.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:04:37,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:04:37,571 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;@2d7100ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:04:37,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:04:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 15:04:37,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:37,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:37,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:37,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2130028706, now seen corresponding path program 1 times [2025-03-16 15:04:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:37,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135590462] [2025-03-16 15:04:37,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:37,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:37,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 15:04:37,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 15:04:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135590462] [2025-03-16 15:04:37,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135590462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:37,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:37,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834839910] [2025-03-16 15:04:37,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:37,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:04:37,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:37,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:04:37,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:04:37,736 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:37,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:37,804 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:04:37,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:04:37,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-16 15:04:37,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:37,826 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:04:37,827 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:04:37,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:04:37,833 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:37,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:04:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:04:37,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:04:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:37,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:04:37,910 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 60 [2025-03-16 15:04:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:37,911 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:04:37,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:04:37,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-16 15:04:37,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:37,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:37,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:04:37,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:37,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:37,914 INFO L85 PathProgramCache]: Analyzing trace with hash 777184515, now seen corresponding path program 1 times [2025-03-16 15:04:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947507524] [2025-03-16 15:04:37,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:37,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:37,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-16 15:04:37,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-16 15:04:37,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:37,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947507524] [2025-03-16 15:04:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947507524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899849622] [2025-03-16 15:04:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:38,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:38,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:38,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:38,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:38,376 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:43,152 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2025-03-16 15:04:43,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-16 15:04:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:43,161 INFO L225 Difference]: With dead ends: 3696 [2025-03-16 15:04:43,161 INFO L226 Difference]: Without dead ends: 2663 [2025-03-16 15:04:43,163 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-16 15:04:43,163 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 2640 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 5613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:43,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 1002 Invalid, 5613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4126 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:04:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-16 15:04:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2025-03-16 15:04:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2025-03-16 15:04:43,223 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 60 [2025-03-16 15:04:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:43,224 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2025-03-16 15:04:43,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2025-03-16 15:04:43,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 15:04:43,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:43,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:04:43,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:04:43,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:43,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:43,227 INFO L85 PathProgramCache]: Analyzing trace with hash 859654327, now seen corresponding path program 1 times [2025-03-16 15:04:43,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:43,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568861348] [2025-03-16 15:04:43,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:43,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:43,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 15:04:43,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 15:04:43,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:43,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:43,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:43,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568861348] [2025-03-16 15:04:43,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568861348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:43,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:43,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:43,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634029556] [2025-03-16 15:04:43,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:43,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:43,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:43,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:43,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:43,524 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:48,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:48,668 INFO L93 Difference]: Finished difference Result 7863 states and 12668 transitions. [2025-03-16 15:04:48,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:48,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2025-03-16 15:04:48,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:48,687 INFO L225 Difference]: With dead ends: 7863 [2025-03-16 15:04:48,687 INFO L226 Difference]: Without dead ends: 5989 [2025-03-16 15:04:48,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:48,692 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 1695 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5283 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1695 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 6126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:48,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1695 Valid, 1066 Invalid, 6126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 5283 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:04:48,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2025-03-16 15:04:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5858. [2025-03-16 15:04:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5858 states, 5857 states have (on average 1.4452791531500768) internal successors, (8465), 5857 states have internal predecessors, (8465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 8465 transitions. [2025-03-16 15:04:48,770 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 8465 transitions. Word has length 185 [2025-03-16 15:04:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:48,772 INFO L471 AbstractCegarLoop]: Abstraction has 5858 states and 8465 transitions. [2025-03-16 15:04:48,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 8465 transitions. [2025-03-16 15:04:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 15:04:48,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:48,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:48,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:04:48,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:48,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:48,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1717913962, now seen corresponding path program 1 times [2025-03-16 15:04:48,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:48,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763511966] [2025-03-16 15:04:48,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:48,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:48,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 15:04:48,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 15:04:48,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:48,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:04:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763511966] [2025-03-16 15:04:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763511966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:48,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:48,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242284794] [2025-03-16 15:04:48,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:48,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:48,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:48,965 INFO L87 Difference]: Start difference. First operand 5858 states and 8465 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:51,454 INFO L93 Difference]: Finished difference Result 15686 states and 23389 transitions. [2025-03-16 15:04:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 227 [2025-03-16 15:04:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:51,481 INFO L225 Difference]: With dead ends: 15686 [2025-03-16 15:04:51,481 INFO L226 Difference]: Without dead ends: 10616 [2025-03-16 15:04:51,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:51,488 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:51,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 918 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:04:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10616 states. [2025-03-16 15:04:51,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10616 to 10607. [2025-03-16 15:04:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10607 states, 10606 states have (on average 1.3551763152932303) internal successors, (14373), 10606 states have internal predecessors, (14373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 14373 transitions. [2025-03-16 15:04:51,613 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 14373 transitions. Word has length 227 [2025-03-16 15:04:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:51,614 INFO L471 AbstractCegarLoop]: Abstraction has 10607 states and 14373 transitions. [2025-03-16 15:04:51,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:51,614 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 14373 transitions. [2025-03-16 15:04:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-16 15:04:51,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:51,616 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:51,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:04:51,616 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:51,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 472899709, now seen corresponding path program 1 times [2025-03-16 15:04:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:51,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142873529] [2025-03-16 15:04:51,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:51,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:51,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-16 15:04:51,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-16 15:04:51,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:51,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:51,816 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:04:51,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:51,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142873529] [2025-03-16 15:04:51,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142873529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:51,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:51,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:51,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172539188] [2025-03-16 15:04:51,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:51,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:51,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:51,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:51,819 INFO L87 Difference]: Start difference. First operand 10607 states and 14373 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:54,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:54,329 INFO L93 Difference]: Finished difference Result 28350 states and 39239 transitions. [2025-03-16 15:04:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:54,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 241 [2025-03-16 15:04:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:54,365 INFO L225 Difference]: With dead ends: 28350 [2025-03-16 15:04:54,365 INFO L226 Difference]: Without dead ends: 18531 [2025-03-16 15:04:54,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:54,372 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:54,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 614 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:04:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18531 states. [2025-03-16 15:04:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18531 to 18522. [2025-03-16 15:04:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18522 states, 18521 states have (on average 1.3251444306462934) internal successors, (24543), 18521 states have internal predecessors, (24543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18522 states to 18522 states and 24543 transitions. [2025-03-16 15:04:54,577 INFO L78 Accepts]: Start accepts. Automaton has 18522 states and 24543 transitions. Word has length 241 [2025-03-16 15:04:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:54,577 INFO L471 AbstractCegarLoop]: Abstraction has 18522 states and 24543 transitions. [2025-03-16 15:04:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:54,578 INFO L276 IsEmpty]: Start isEmpty. Operand 18522 states and 24543 transitions. [2025-03-16 15:04:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-16 15:04:54,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:54,583 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:54,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:04:54,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:54,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:54,584 INFO L85 PathProgramCache]: Analyzing trace with hash 28377002, now seen corresponding path program 1 times [2025-03-16 15:04:54,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:54,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195588285] [2025-03-16 15:04:54,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:54,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-16 15:04:54,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-16 15:04:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:54,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195588285] [2025-03-16 15:04:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195588285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:54,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:54,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670657008] [2025-03-16 15:04:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:54,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:54,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:54,803 INFO L87 Difference]: Start difference. First operand 18522 states and 24543 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:57,453 INFO L93 Difference]: Finished difference Result 52014 states and 69798 transitions. [2025-03-16 15:04:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:57,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-16 15:04:57,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:57,508 INFO L225 Difference]: With dead ends: 52014 [2025-03-16 15:04:57,508 INFO L226 Difference]: Without dead ends: 34280 [2025-03-16 15:04:57,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:57,527 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 850 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:57,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 947 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:04:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34280 states. [2025-03-16 15:04:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34280 to 34270. [2025-03-16 15:04:57,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34270 states, 34269 states have (on average 1.2549242755843473) internal successors, (43005), 34269 states have internal predecessors, (43005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34270 states to 34270 states and 43005 transitions. [2025-03-16 15:04:57,948 INFO L78 Accepts]: Start accepts. Automaton has 34270 states and 43005 transitions. Word has length 259 [2025-03-16 15:04:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:57,949 INFO L471 AbstractCegarLoop]: Abstraction has 34270 states and 43005 transitions. [2025-03-16 15:04:57,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 34270 states and 43005 transitions. [2025-03-16 15:04:57,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-16 15:04:57,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:57,952 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:57,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:04:57,953 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:57,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:57,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1701669994, now seen corresponding path program 1 times [2025-03-16 15:04:57,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:57,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48596892] [2025-03-16 15:04:57,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:57,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:57,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-16 15:04:57,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-16 15:04:57,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:57,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-16 15:04:58,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:58,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48596892] [2025-03-16 15:04:58,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48596892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:58,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:58,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:58,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803590411] [2025-03-16 15:04:58,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:58,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:58,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:58,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:58,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:58,159 INFO L87 Difference]: Start difference. First operand 34270 states and 43005 transitions. Second operand has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:00,827 INFO L93 Difference]: Finished difference Result 92928 states and 117607 transitions. [2025-03-16 15:05:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 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 290 [2025-03-16 15:05:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:00,911 INFO L225 Difference]: With dead ends: 92928 [2025-03-16 15:05:00,911 INFO L226 Difference]: Without dead ends: 59446 [2025-03-16 15:05:00,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:00,940 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 856 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:00,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 984 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:05:00,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59446 states. [2025-03-16 15:05:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59446 to 56293. [2025-03-16 15:05:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56293 states, 56292 states have (on average 1.200508065089178) internal successors, (67579), 56292 states have internal predecessors, (67579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56293 states to 56293 states and 67579 transitions. [2025-03-16 15:05:01,506 INFO L78 Accepts]: Start accepts. Automaton has 56293 states and 67579 transitions. Word has length 290 [2025-03-16 15:05:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 56293 states and 67579 transitions. [2025-03-16 15:05:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.333333333333336) internal successors, (187), 2 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56293 states and 67579 transitions. [2025-03-16 15:05:01,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 15:05:01,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:01,512 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:01,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:05:01,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:01,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:01,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1131685207, now seen corresponding path program 1 times [2025-03-16 15:05:01,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:01,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044676773] [2025-03-16 15:05:01,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:01,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 15:05:01,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 15:05:01,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:01,838 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-16 15:05:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044676773] [2025-03-16 15:05:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044676773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868512282] [2025-03-16 15:05:01,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:01,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:01,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:01,840 INFO L87 Difference]: Start difference. First operand 56293 states and 67579 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:07,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:07,114 INFO L93 Difference]: Finished difference Result 151371 states and 183854 transitions. [2025-03-16 15:05:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:07,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 348 [2025-03-16 15:05:07,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:07,233 INFO L225 Difference]: With dead ends: 151371 [2025-03-16 15:05:07,233 INFO L226 Difference]: Without dead ends: 95866 [2025-03-16 15:05:07,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:07,265 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 1733 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 6694 mSolverCounterSat, 1118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1733 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 7812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1118 IncrementalHoareTripleChecker+Valid, 6694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:07,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1733 Valid, 754 Invalid, 7812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1118 Valid, 6694 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-16 15:05:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95866 states. [2025-03-16 15:05:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95866 to 94951. [2025-03-16 15:05:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94951 states, 94950 states have (on average 1.1962927856766719) internal successors, (113588), 94950 states have internal predecessors, (113588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94951 states to 94951 states and 113588 transitions. [2025-03-16 15:05:08,374 INFO L78 Accepts]: Start accepts. Automaton has 94951 states and 113588 transitions. Word has length 348 [2025-03-16 15:05:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:08,375 INFO L471 AbstractCegarLoop]: Abstraction has 94951 states and 113588 transitions. [2025-03-16 15:05:08,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94951 states and 113588 transitions. [2025-03-16 15:05:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 15:05:08,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:08,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:08,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:05:08,382 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:08,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:08,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1211241227, now seen corresponding path program 1 times [2025-03-16 15:05:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:08,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131162065] [2025-03-16 15:05:08,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:08,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 15:05:08,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 15:05:08,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-16 15:05:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:08,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131162065] [2025-03-16 15:05:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131162065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470923546] [2025-03-16 15:05:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:08,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:08,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:08,692 INFO L87 Difference]: Start difference. First operand 94951 states and 113588 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:11,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:11,688 INFO L93 Difference]: Finished difference Result 219847 states and 261775 transitions. [2025-03-16 15:05:11,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:11,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 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 357 [2025-03-16 15:05:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:11,837 INFO L225 Difference]: With dead ends: 219847 [2025-03-16 15:05:11,837 INFO L226 Difference]: Without dead ends: 125684 [2025-03-16 15:05:11,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:11,888 INFO L435 NwaCegarLoop]: 1858 mSDtfsCounter, 752 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2606 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1999 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 2606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:11,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1999 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 2606 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:05:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125684 states. [2025-03-16 15:05:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125684 to 125646. [2025-03-16 15:05:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125646 states, 125645 states have (on average 1.1693103585498825) internal successors, (146918), 125645 states have internal predecessors, (146918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125646 states to 125646 states and 146918 transitions. [2025-03-16 15:05:13,280 INFO L78 Accepts]: Start accepts. Automaton has 125646 states and 146918 transitions. Word has length 357 [2025-03-16 15:05:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:13,280 INFO L471 AbstractCegarLoop]: Abstraction has 125646 states and 146918 transitions. [2025-03-16 15:05:13,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:13,280 INFO L276 IsEmpty]: Start isEmpty. Operand 125646 states and 146918 transitions. [2025-03-16 15:05:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-16 15:05:13,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:13,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:13,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:05:13,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:13,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash 90379770, now seen corresponding path program 1 times [2025-03-16 15:05:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089154360] [2025-03-16 15:05:13,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:13,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:13,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-16 15:05:13,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-16 15:05:13,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:13,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 396 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-16 15:05:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:13,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089154360] [2025-03-16 15:05:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089154360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:13,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502303927] [2025-03-16 15:05:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:13,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:13,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:13,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:13,668 INFO L87 Difference]: Start difference. First operand 125646 states and 146918 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:16,822 INFO L93 Difference]: Finished difference Result 257561 states and 300075 transitions. [2025-03-16 15:05:16,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:16,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2025-03-16 15:05:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:17,099 INFO L225 Difference]: With dead ends: 257561 [2025-03-16 15:05:17,099 INFO L226 Difference]: Without dead ends: 128763 [2025-03-16 15:05:17,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:17,126 INFO L435 NwaCegarLoop]: 1512 mSDtfsCounter, 1036 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:17,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 1649 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:05:17,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128763 states. [2025-03-16 15:05:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128763 to 120876. [2025-03-16 15:05:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120876 states, 120875 states have (on average 1.1136297828335058) internal successors, (134610), 120875 states have internal predecessors, (134610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120876 states to 120876 states and 134610 transitions. [2025-03-16 15:05:18,216 INFO L78 Accepts]: Start accepts. Automaton has 120876 states and 134610 transitions. Word has length 377 [2025-03-16 15:05:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:18,216 INFO L471 AbstractCegarLoop]: Abstraction has 120876 states and 134610 transitions. [2025-03-16 15:05:18,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 120876 states and 134610 transitions. [2025-03-16 15:05:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-16 15:05:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:18,220 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:05:18,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:18,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1212129220, now seen corresponding path program 1 times [2025-03-16 15:05:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967111596] [2025-03-16 15:05:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:18,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 15:05:18,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 15:05:18,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:18,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:19,421 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 286 proven. 113 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-16 15:05:19,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967111596] [2025-03-16 15:05:19,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967111596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:19,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244365387] [2025-03-16 15:05:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:19,424 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:05:19,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:05:19,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-16 15:05:19,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-16 15:05:19,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:19,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:19,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:05:19,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-16 15:05:19,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:19,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244365387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:19,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:19,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:05:19,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221057007] [2025-03-16 15:05:19,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:19,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:19,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:19,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:19,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:19,746 INFO L87 Difference]: Start difference. First operand 120876 states and 134610 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:22,290 INFO L93 Difference]: Finished difference Result 238600 states and 265620 transitions. [2025-03-16 15:05:22,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:22,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 386 [2025-03-16 15:05:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:22,446 INFO L225 Difference]: With dead ends: 238600 [2025-03-16 15:05:22,446 INFO L226 Difference]: Without dead ends: 118512 [2025-03-16 15:05:22,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:22,513 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:22,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1422 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:05:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118512 states. [2025-03-16 15:05:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118512 to 117720. [2025-03-16 15:05:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117720 states, 117719 states have (on average 1.0858230192237446) internal successors, (127822), 117719 states have internal predecessors, (127822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:23,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117720 states to 117720 states and 127822 transitions. [2025-03-16 15:05:23,762 INFO L78 Accepts]: Start accepts. Automaton has 117720 states and 127822 transitions. Word has length 386 [2025-03-16 15:05:23,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:23,763 INFO L471 AbstractCegarLoop]: Abstraction has 117720 states and 127822 transitions. [2025-03-16 15:05:23,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:23,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117720 states and 127822 transitions. [2025-03-16 15:05:23,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2025-03-16 15:05:23,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:23,771 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:23,778 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-16 15:05:23,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:05:23,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:23,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:23,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1001777212, now seen corresponding path program 1 times [2025-03-16 15:05:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:23,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255273568] [2025-03-16 15:05:23,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:23,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:23,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 454 statements into 1 equivalence classes. [2025-03-16 15:05:24,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 454 of 454 statements. [2025-03-16 15:05:24,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:24,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 462 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:05:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255273568] [2025-03-16 15:05:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255273568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018929394] [2025-03-16 15:05:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:24,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:24,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:24,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:24,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:24,167 INFO L87 Difference]: Start difference. First operand 117720 states and 127822 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:27,351 INFO L93 Difference]: Finished difference Result 269293 states and 294397 transitions. [2025-03-16 15:05:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 454 [2025-03-16 15:05:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:27,527 INFO L225 Difference]: With dead ends: 269293 [2025-03-16 15:05:27,527 INFO L226 Difference]: Without dead ends: 149213 [2025-03-16 15:05:27,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:27,590 INFO L435 NwaCegarLoop]: 1738 mSDtfsCounter, 786 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:27,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1882 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:05:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149213 states. [2025-03-16 15:05:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149213 to 146836. [2025-03-16 15:05:29,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146836 states, 146835 states have (on average 1.0730207375625702) internal successors, (157557), 146835 states have internal predecessors, (157557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:29,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146836 states to 146836 states and 157557 transitions. [2025-03-16 15:05:29,253 INFO L78 Accepts]: Start accepts. Automaton has 146836 states and 157557 transitions. Word has length 454 [2025-03-16 15:05:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:29,254 INFO L471 AbstractCegarLoop]: Abstraction has 146836 states and 157557 transitions. [2025-03-16 15:05:29,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 146836 states and 157557 transitions. [2025-03-16 15:05:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-16 15:05:29,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:29,261 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:29,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:05:29,261 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:29,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:29,262 INFO L85 PathProgramCache]: Analyzing trace with hash 122247289, now seen corresponding path program 1 times [2025-03-16 15:05:29,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429094176] [2025-03-16 15:05:29,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:29,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-16 15:05:29,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-16 15:05:29,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:29,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-16 15:05:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429094176] [2025-03-16 15:05:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429094176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:29,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889639137] [2025-03-16 15:05:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:29,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:29,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:29,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:29,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:29,646 INFO L87 Difference]: Start difference. First operand 146836 states and 157557 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:32,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:32,638 INFO L93 Difference]: Finished difference Result 325158 states and 351180 transitions. [2025-03-16 15:05:32,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:32,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 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 464 [2025-03-16 15:05:32,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:32,839 INFO L225 Difference]: With dead ends: 325158 [2025-03-16 15:05:32,839 INFO L226 Difference]: Without dead ends: 179110 [2025-03-16 15:05:32,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:32,922 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 966 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:32,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 734 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:05:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179110 states. [2025-03-16 15:05:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179110 to 175943. [2025-03-16 15:05:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175943 states, 175942 states have (on average 1.0777983653704062) internal successors, (189630), 175942 states have internal predecessors, (189630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175943 states to 175943 states and 189630 transitions. [2025-03-16 15:05:35,161 INFO L78 Accepts]: Start accepts. Automaton has 175943 states and 189630 transitions. Word has length 464 [2025-03-16 15:05:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 175943 states and 189630 transitions. [2025-03-16 15:05:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 175943 states and 189630 transitions. [2025-03-16 15:05:35,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-03-16 15:05:35,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:35,176 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:35,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:05:35,176 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:35,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:35,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1893301575, now seen corresponding path program 1 times [2025-03-16 15:05:35,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:35,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307111410] [2025-03-16 15:05:35,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:35,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:35,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-03-16 15:05:35,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-03-16 15:05:35,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:35,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 893 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-03-16 15:05:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307111410] [2025-03-16 15:05:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307111410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:35,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111139756] [2025-03-16 15:05:35,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:35,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:35,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:35,341 INFO L87 Difference]: Start difference. First operand 175943 states and 189630 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:38,458 INFO L93 Difference]: Finished difference Result 352678 states and 380061 transitions. [2025-03-16 15:05:38,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:38,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 525 [2025-03-16 15:05:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:38,663 INFO L225 Difference]: With dead ends: 352678 [2025-03-16 15:05:38,663 INFO L226 Difference]: Without dead ends: 177523 [2025-03-16 15:05:38,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:38,718 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 936 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:38,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1481 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:05:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177523 states. [2025-03-16 15:05:40,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177523 to 175936. [2025-03-16 15:05:40,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175936 states, 175935 states have (on average 1.0599539602694177) internal successors, (186483), 175935 states have internal predecessors, (186483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175936 states to 175936 states and 186483 transitions. [2025-03-16 15:05:40,679 INFO L78 Accepts]: Start accepts. Automaton has 175936 states and 186483 transitions. Word has length 525 [2025-03-16 15:05:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:40,679 INFO L471 AbstractCegarLoop]: Abstraction has 175936 states and 186483 transitions. [2025-03-16 15:05:40,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 175936 states and 186483 transitions. [2025-03-16 15:05:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-16 15:05:40,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:40,693 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:40,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:05:40,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:40,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:40,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1575855138, now seen corresponding path program 1 times [2025-03-16 15:05:40,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:40,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087434041] [2025-03-16 15:05:40,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:40,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:40,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-16 15:05:40,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-16 15:05:40,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:40,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 781 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-16 15:05:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:41,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087434041] [2025-03-16 15:05:41,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087434041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:41,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:41,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472692930] [2025-03-16 15:05:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:41,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:41,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:41,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:41,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:41,244 INFO L87 Difference]: Start difference. First operand 175936 states and 186483 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:43,934 INFO L93 Difference]: Finished difference Result 352682 states and 373795 transitions. [2025-03-16 15:05:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:43,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 544 [2025-03-16 15:05:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:44,151 INFO L225 Difference]: With dead ends: 352682 [2025-03-16 15:05:44,151 INFO L226 Difference]: Without dead ends: 177534 [2025-03-16 15:05:44,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:44,246 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 814 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:44,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1042 Invalid, 2752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:05:44,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177534 states. [2025-03-16 15:05:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177534 to 175148. [2025-03-16 15:05:46,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175148 states, 175147 states have (on average 1.0543315043934525) internal successors, (184663), 175147 states have internal predecessors, (184663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175148 states to 175148 states and 184663 transitions. [2025-03-16 15:05:46,238 INFO L78 Accepts]: Start accepts. Automaton has 175148 states and 184663 transitions. Word has length 544 [2025-03-16 15:05:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:46,239 INFO L471 AbstractCegarLoop]: Abstraction has 175148 states and 184663 transitions. [2025-03-16 15:05:46,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 175148 states and 184663 transitions. [2025-03-16 15:05:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-03-16 15:05:46,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:46,258 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:05:46,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:46,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1665496857, now seen corresponding path program 1 times [2025-03-16 15:05:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90419858] [2025-03-16 15:05:46,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:46,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:46,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-03-16 15:05:46,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-03-16 15:05:46,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:46,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2025-03-16 15:05:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90419858] [2025-03-16 15:05:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90419858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:46,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:46,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631568036] [2025-03-16 15:05:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:46,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:46,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:46,955 INFO L87 Difference]: Start difference. First operand 175148 states and 184663 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:05:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:50,011 INFO L93 Difference]: Finished difference Result 363695 states and 384209 transitions. [2025-03-16 15:05:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 566 [2025-03-16 15:05:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:50,269 INFO L225 Difference]: With dead ends: 363695 [2025-03-16 15:05:50,269 INFO L226 Difference]: Without dead ends: 209016 [2025-03-16 15:05:50,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:50,366 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 820 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2845 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 2845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:50,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1709 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 2845 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:05:50,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209016 states.