./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label02.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 adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:07:25,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:07:25,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:07:25,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:07:25,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:07:25,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:07:25,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:07:25,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:07:25,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:07:25,411 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:07:25,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:07:25,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:07:25,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:07:25,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:07:25,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:07:25,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:07:25,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:25,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:07:25,412 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:07:25,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:07:25,413 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 -> adb370abe9a266817aee227dfaf2ff5e2cfdcfe49f97cfc66a125d7a6f5fbb19 [2025-03-08 02:07:25,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:07:25,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:07:25,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:07:25,660 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:07:25,660 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:07:25,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2025-03-08 02:07:26,816 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5119a1123/87039ef772c94888a181968f99ba3912/FLAG1da814f95 [2025-03-08 02:07:27,250 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:07:27,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label02.c [2025-03-08 02:07:27,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5119a1123/87039ef772c94888a181968f99ba3912/FLAG1da814f95 [2025-03-08 02:07:27,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5119a1123/87039ef772c94888a181968f99ba3912 [2025-03-08 02:07:27,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:07:27,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:07:27,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:27,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:07:27,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:07:27,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:27" (1/1) ... [2025-03-08 02:07:27,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1a7767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:27, skipping insertion in model container [2025-03-08 02:07:27,393 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:07:27" (1/1) ... [2025-03-08 02:07:27,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:07:27,611 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/Problem17_label02.c[7859,7872] [2025-03-08 02:07:27,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:27,969 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:07:27,985 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/Problem17_label02.c[7859,7872] [2025-03-08 02:07:28,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:07:28,177 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:07:28,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28 WrapperNode [2025-03-08 02:07:28,178 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:07:28,179 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:28,179 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:07:28,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:07:28,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,219 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,420 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:07:28,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:07:28,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:07:28,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:07:28,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:07:28,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,595 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:07:28,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:07:28,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:07:28,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:07:28,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:07:28,755 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (1/1) ... [2025-03-08 02:07:28,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:07:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:28,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:07:28,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:07:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:07:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:07:28,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:07:28,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:07:28,856 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:07:28,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:07:31,521 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:07:31,614 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:07:31,614 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:07:31,639 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:07:31,639 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:07:31,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:31 BoogieIcfgContainer [2025-03-08 02:07:31,639 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:07:31,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:07:31,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:07:31,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:07:31,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:07:27" (1/3) ... [2025-03-08 02:07:31,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1786a91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:31, skipping insertion in model container [2025-03-08 02:07:31,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:07:28" (2/3) ... [2025-03-08 02:07:31,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1786a91f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:07:31, skipping insertion in model container [2025-03-08 02:07:31,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:07:31" (3/3) ... [2025-03-08 02:07:31,647 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label02.c [2025-03-08 02:07:31,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:07:31,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label02.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:07:31,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:07:31,729 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;@c113506, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:07:31,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:07:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 02:07:31,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:31,742 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] [2025-03-08 02:07:31,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:31,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:31,747 INFO L85 PathProgramCache]: Analyzing trace with hash -156949145, now seen corresponding path program 1 times [2025-03-08 02:07:31,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:31,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897631641] [2025-03-08 02:07:31,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:31,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 02:07:31,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 02:07:31,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:31,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:32,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:32,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897631641] [2025-03-08 02:07:32,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897631641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:32,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:32,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:32,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14176715] [2025-03-08 02:07:32,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:32,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:32,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:32,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:32,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:32,130 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:34,220 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-03-08 02:07:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-08 02:07:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:34,240 INFO L225 Difference]: With dead ends: 1644 [2025-03-08 02:07:34,240 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 02:07:34,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:34,250 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 435 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:34,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:07:34,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 02:07:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-03-08 02:07:34,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-03-08 02:07:34,348 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 53 [2025-03-08 02:07:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-03-08 02:07:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-03-08 02:07:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 02:07:34,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:34,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:34,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:07:34,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:34,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:34,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1814424858, now seen corresponding path program 1 times [2025-03-08 02:07:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021933116] [2025-03-08 02:07:34,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:34,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 02:07:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 02:07:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021933116] [2025-03-08 02:07:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021933116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:34,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734757807] [2025-03-08 02:07:34,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:34,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:34,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:34,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:34,570 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:36,317 INFO L93 Difference]: Finished difference Result 2813 states and 4381 transitions. [2025-03-08 02:07:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:36,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-03-08 02:07:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:36,323 INFO L225 Difference]: With dead ends: 2813 [2025-03-08 02:07:36,323 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:07:36,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:36,325 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:36,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 580 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:07:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:07:36,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1841. [2025-03-08 02:07:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1841 states, 1840 states have (on average 1.35) internal successors, (2484), 1840 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 2484 transitions. [2025-03-08 02:07:36,360 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 2484 transitions. Word has length 120 [2025-03-08 02:07:36,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:36,361 INFO L471 AbstractCegarLoop]: Abstraction has 1841 states and 2484 transitions. [2025-03-08 02:07:36,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:36,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 2484 transitions. [2025-03-08 02:07:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 02:07:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:36,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:36,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:07:36,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash -46201250, now seen corresponding path program 1 times [2025-03-08 02:07:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370764367] [2025-03-08 02:07:36,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:36,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:36,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 02:07:36,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 02:07:36,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:36,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:36,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370764367] [2025-03-08 02:07:36,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370764367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:36,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:36,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:36,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243154511] [2025-03-08 02:07:36,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:36,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:36,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:36,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:36,682 INFO L87 Difference]: Start difference. First operand 1841 states and 2484 transitions. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:39,634 INFO L93 Difference]: Finished difference Result 6765 states and 9258 transitions. [2025-03-08 02:07:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:39,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-08 02:07:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:39,649 INFO L225 Difference]: With dead ends: 6765 [2025-03-08 02:07:39,649 INFO L226 Difference]: Without dead ends: 4926 [2025-03-08 02:07:39,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:39,652 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 859 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:39,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 328 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 02:07:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2025-03-08 02:07:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 4875. [2025-03-08 02:07:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4875 states, 4874 states have (on average 1.286417726713172) internal successors, (6270), 4874 states have internal predecessors, (6270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4875 states to 4875 states and 6270 transitions. [2025-03-08 02:07:39,715 INFO L78 Accepts]: Start accepts. Automaton has 4875 states and 6270 transitions. Word has length 123 [2025-03-08 02:07:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:39,716 INFO L471 AbstractCegarLoop]: Abstraction has 4875 states and 6270 transitions. [2025-03-08 02:07:39,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:39,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 6270 transitions. [2025-03-08 02:07:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 02:07:39,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:39,721 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, 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] [2025-03-08 02:07:39,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:07:39,722 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:39,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash 161187097, now seen corresponding path program 1 times [2025-03-08 02:07:39,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:39,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31624468] [2025-03-08 02:07:39,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:39,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 02:07:39,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 02:07:39,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 02:07:39,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:39,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31624468] [2025-03-08 02:07:39,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31624468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:39,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:39,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077517006] [2025-03-08 02:07:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:39,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:39,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:39,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:39,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:39,916 INFO L87 Difference]: Start difference. First operand 4875 states and 6270 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:41,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:41,486 INFO L93 Difference]: Finished difference Result 14436 states and 18541 transitions. [2025-03-08 02:07:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:41,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 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 194 [2025-03-08 02:07:41,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:41,510 INFO L225 Difference]: With dead ends: 14436 [2025-03-08 02:07:41,510 INFO L226 Difference]: Without dead ends: 8277 [2025-03-08 02:07:41,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:41,520 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:41,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:07:41,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8277 states. [2025-03-08 02:07:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8277 to 6147. [2025-03-08 02:07:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6147 states, 6146 states have (on average 1.1906931337455255) internal successors, (7318), 6146 states have internal predecessors, (7318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6147 states to 6147 states and 7318 transitions. [2025-03-08 02:07:41,630 INFO L78 Accepts]: Start accepts. Automaton has 6147 states and 7318 transitions. Word has length 194 [2025-03-08 02:07:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:41,631 INFO L471 AbstractCegarLoop]: Abstraction has 6147 states and 7318 transitions. [2025-03-08 02:07:41,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6147 states and 7318 transitions. [2025-03-08 02:07:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 02:07:41,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:41,635 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, 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] [2025-03-08 02:07:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:07:41,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:41,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 875758791, now seen corresponding path program 1 times [2025-03-08 02:07:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850362047] [2025-03-08 02:07:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:41,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 02:07:41,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 02:07:41,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:07:41,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850362047] [2025-03-08 02:07:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850362047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:41,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402279235] [2025-03-08 02:07:41,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:41,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:41,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:41,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:41,868 INFO L87 Difference]: Start difference. First operand 6147 states and 7318 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:43,459 INFO L93 Difference]: Finished difference Result 15692 states and 18897 transitions. [2025-03-08 02:07:43,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:43,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 207 [2025-03-08 02:07:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:43,479 INFO L225 Difference]: With dead ends: 15692 [2025-03-08 02:07:43,479 INFO L226 Difference]: Without dead ends: 9547 [2025-03-08 02:07:43,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:43,484 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 407 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:43,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 477 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:07:43,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2025-03-08 02:07:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 6124. [2025-03-08 02:07:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6124 states, 6123 states have (on average 1.1894496162012085) internal successors, (7283), 6123 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:43,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6124 states to 6124 states and 7283 transitions. [2025-03-08 02:07:43,567 INFO L78 Accepts]: Start accepts. Automaton has 6124 states and 7283 transitions. Word has length 207 [2025-03-08 02:07:43,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:43,568 INFO L471 AbstractCegarLoop]: Abstraction has 6124 states and 7283 transitions. [2025-03-08 02:07:43,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 6124 states and 7283 transitions. [2025-03-08 02:07:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 02:07:43,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:43,570 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:43,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:07:43,570 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:43,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:43,571 INFO L85 PathProgramCache]: Analyzing trace with hash -296155943, now seen corresponding path program 1 times [2025-03-08 02:07:43,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:43,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628103013] [2025-03-08 02:07:43,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:43,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:43,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 02:07:43,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 02:07:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:07:43,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:43,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628103013] [2025-03-08 02:07:43,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628103013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:43,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:43,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892725229] [2025-03-08 02:07:43,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:43,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:43,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:43,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:43,729 INFO L87 Difference]: Start difference. First operand 6124 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:45,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:45,080 INFO L93 Difference]: Finished difference Result 16078 states and 19444 transitions. [2025-03-08 02:07:45,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:45,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-03-08 02:07:45,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:45,106 INFO L225 Difference]: With dead ends: 16078 [2025-03-08 02:07:45,106 INFO L226 Difference]: Without dead ends: 9956 [2025-03-08 02:07:45,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:45,113 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 487 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:45,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 788 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:07:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9956 states. [2025-03-08 02:07:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9956 to 9956. [2025-03-08 02:07:45,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9956 states, 9955 states have (on average 1.171672526368659) internal successors, (11664), 9955 states have internal predecessors, (11664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:45,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9956 states to 9956 states and 11664 transitions. [2025-03-08 02:07:45,222 INFO L78 Accepts]: Start accepts. Automaton has 9956 states and 11664 transitions. Word has length 214 [2025-03-08 02:07:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:45,222 INFO L471 AbstractCegarLoop]: Abstraction has 9956 states and 11664 transitions. [2025-03-08 02:07:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9956 states and 11664 transitions. [2025-03-08 02:07:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-08 02:07:45,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:45,226 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:45,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:07:45,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:45,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1989467582, now seen corresponding path program 1 times [2025-03-08 02:07:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012194324] [2025-03-08 02:07:45,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:45,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 02:07:45,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 02:07:45,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:45,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:07:45,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:45,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012194324] [2025-03-08 02:07:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012194324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:45,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310719750] [2025-03-08 02:07:45,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:45,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:45,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:45,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:45,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:07:45,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-08 02:07:45,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-08 02:07:45,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:45,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:45,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:07:45,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 240 proven. 70 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:07:45,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:07:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310719750] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:07:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373652813] [2025-03-08 02:07:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:46,300 INFO L87 Difference]: Start difference. First operand 9956 states and 11664 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:48,643 INFO L93 Difference]: Finished difference Result 30575 states and 36167 transitions. [2025-03-08 02:07:48,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 277 [2025-03-08 02:07:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:48,670 INFO L225 Difference]: With dead ends: 30575 [2025-03-08 02:07:48,670 INFO L226 Difference]: Without dead ends: 19763 [2025-03-08 02:07:48,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:48,680 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 889 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:48,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 161 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:07:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19763 states. [2025-03-08 02:07:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19763 to 19760. [2025-03-08 02:07:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19760 states, 19759 states have (on average 1.1599777316665822) internal successors, (22920), 19759 states have internal predecessors, (22920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19760 states to 19760 states and 22920 transitions. [2025-03-08 02:07:48,923 INFO L78 Accepts]: Start accepts. Automaton has 19760 states and 22920 transitions. Word has length 277 [2025-03-08 02:07:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:48,924 INFO L471 AbstractCegarLoop]: Abstraction has 19760 states and 22920 transitions. [2025-03-08 02:07:48,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 19760 states and 22920 transitions. [2025-03-08 02:07:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-08 02:07:48,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:48,928 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:48,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:07:49,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:49,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:49,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:49,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1625610500, now seen corresponding path program 1 times [2025-03-08 02:07:49,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933177297] [2025-03-08 02:07:49,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:49,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-08 02:07:49,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-08 02:07:49,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:49,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:07:49,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:49,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933177297] [2025-03-08 02:07:49,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933177297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:49,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:49,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129066201] [2025-03-08 02:07:49,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:49,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:49,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:49,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:49,280 INFO L87 Difference]: Start difference. First operand 19760 states and 22920 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:50,861 INFO L93 Difference]: Finished difference Result 42909 states and 49989 transitions. [2025-03-08 02:07:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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-08 02:07:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:50,904 INFO L225 Difference]: With dead ends: 42909 [2025-03-08 02:07:50,904 INFO L226 Difference]: Without dead ends: 23151 [2025-03-08 02:07:50,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:50,922 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 374 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:50,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:07:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23151 states. [2025-03-08 02:07:51,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23151 to 22725. [2025-03-08 02:07:51,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22725 states, 22724 states have (on average 1.1456169688435134) internal successors, (26033), 22724 states have internal predecessors, (26033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22725 states to 22725 states and 26033 transitions. [2025-03-08 02:07:51,162 INFO L78 Accepts]: Start accepts. Automaton has 22725 states and 26033 transitions. Word has length 290 [2025-03-08 02:07:51,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:51,162 INFO L471 AbstractCegarLoop]: Abstraction has 22725 states and 26033 transitions. [2025-03-08 02:07:51,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:51,162 INFO L276 IsEmpty]: Start isEmpty. Operand 22725 states and 26033 transitions. [2025-03-08 02:07:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-08 02:07:51,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:51,166 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:07:51,167 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1054859329, now seen corresponding path program 1 times [2025-03-08 02:07:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:51,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942889901] [2025-03-08 02:07:51,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:51,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-08 02:07:51,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-08 02:07:51,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:51,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 295 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:07:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942889901] [2025-03-08 02:07:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942889901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:07:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684406563] [2025-03-08 02:07:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:51,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:51,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:51,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:51,679 INFO L87 Difference]: Start difference. First operand 22725 states and 26033 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:55,124 INFO L93 Difference]: Finished difference Result 64237 states and 73654 transitions. [2025-03-08 02:07:55,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:55,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 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 313 [2025-03-08 02:07:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:55,226 INFO L225 Difference]: With dead ends: 64237 [2025-03-08 02:07:55,226 INFO L226 Difference]: Without dead ends: 38101 [2025-03-08 02:07:55,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:55,243 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 854 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2908 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 3377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:55,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 371 Invalid, 3377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2908 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 02:07:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38101 states. [2025-03-08 02:07:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38101 to 37204. [2025-03-08 02:07:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37204 states, 37203 states have (on average 1.137462032631777) internal successors, (42317), 37203 states have internal predecessors, (42317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37204 states to 37204 states and 42317 transitions. [2025-03-08 02:07:55,569 INFO L78 Accepts]: Start accepts. Automaton has 37204 states and 42317 transitions. Word has length 313 [2025-03-08 02:07:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:55,569 INFO L471 AbstractCegarLoop]: Abstraction has 37204 states and 42317 transitions. [2025-03-08 02:07:55,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 37204 states and 42317 transitions. [2025-03-08 02:07:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-08 02:07:55,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:55,576 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:55,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:07:55,576 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:55,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:55,577 INFO L85 PathProgramCache]: Analyzing trace with hash -306310242, now seen corresponding path program 1 times [2025-03-08 02:07:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123011137] [2025-03-08 02:07:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-08 02:07:55,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-08 02:07:55,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:55,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:07:55,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:55,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123011137] [2025-03-08 02:07:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123011137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:55,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797298686] [2025-03-08 02:07:55,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:55,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:55,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:55,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:55,830 INFO L87 Difference]: Start difference. First operand 37204 states and 42317 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:57,465 INFO L93 Difference]: Finished difference Result 90182 states and 102746 transitions. [2025-03-08 02:07:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 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 328 [2025-03-08 02:07:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:57,535 INFO L225 Difference]: With dead ends: 90182 [2025-03-08 02:07:57,536 INFO L226 Difference]: Without dead ends: 51278 [2025-03-08 02:07:57,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:57,551 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 363 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:57,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 824 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:07:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2025-03-08 02:07:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 49991. [2025-03-08 02:07:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49991 states, 49990 states have (on average 1.1124624924984996) internal successors, (55612), 49990 states have internal predecessors, (55612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49991 states to 49991 states and 55612 transitions. [2025-03-08 02:07:58,175 INFO L78 Accepts]: Start accepts. Automaton has 49991 states and 55612 transitions. Word has length 328 [2025-03-08 02:07:58,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:58,176 INFO L471 AbstractCegarLoop]: Abstraction has 49991 states and 55612 transitions. [2025-03-08 02:07:58,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 49991 states and 55612 transitions. [2025-03-08 02:07:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-08 02:07:58,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:58,180 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:58,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:07:58,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:58,181 INFO L85 PathProgramCache]: Analyzing trace with hash 993636061, now seen corresponding path program 1 times [2025-03-08 02:07:58,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:58,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570655242] [2025-03-08 02:07:58,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:58,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 02:07:58,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 02:07:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 361 proven. 214 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:07:58,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:58,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570655242] [2025-03-08 02:07:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570655242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:58,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366215502] [2025-03-08 02:07:58,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:58,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:58,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:58,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:58,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:07:58,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 02:07:58,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 02:07:58,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:58,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:58,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:07:58,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 381 proven. 73 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 02:07:58,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-08 02:07:59,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366215502] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:59,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2025-03-08 02:07:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663080502] [2025-03-08 02:07:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:59,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:59,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:59,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:59,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:59,148 INFO L87 Difference]: Start difference. First operand 49991 states and 55612 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:01,751 INFO L93 Difference]: Finished difference Result 118728 states and 132318 transitions. [2025-03-08 02:08:01,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:08:01,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 351 [2025-03-08 02:08:01,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:01,833 INFO L225 Difference]: With dead ends: 118728 [2025-03-08 02:08:01,833 INFO L226 Difference]: Without dead ends: 68739 [2025-03-08 02:08:01,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:08:01,871 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:01,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 199 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:08:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68739 states. [2025-03-08 02:08:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68739 to 64908. [2025-03-08 02:08:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64908 states, 64907 states have (on average 1.1170597932426394) internal successors, (72505), 64907 states have internal predecessors, (72505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64908 states to 64908 states and 72505 transitions. [2025-03-08 02:08:02,559 INFO L78 Accepts]: Start accepts. Automaton has 64908 states and 72505 transitions. Word has length 351 [2025-03-08 02:08:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:02,559 INFO L471 AbstractCegarLoop]: Abstraction has 64908 states and 72505 transitions. [2025-03-08 02:08:02,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 64908 states and 72505 transitions. [2025-03-08 02:08:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 02:08:02,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:02,563 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:02,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:08:02,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 02:08:02,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 253444783, now seen corresponding path program 1 times [2025-03-08 02:08:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:02,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332968531] [2025-03-08 02:08:02,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:02,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:02,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 02:08:02,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 02:08:02,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:02,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:08:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332968531] [2025-03-08 02:08:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332968531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375788923] [2025-03-08 02:08:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:02,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:02,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:02,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:02,934 INFO L87 Difference]: Start difference. First operand 64908 states and 72505 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:04,580 INFO L93 Difference]: Finished difference Result 142175 states and 159014 transitions. [2025-03-08 02:08:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 365 [2025-03-08 02:08:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:04,660 INFO L225 Difference]: With dead ends: 142175 [2025-03-08 02:08:04,660 INFO L226 Difference]: Without dead ends: 76833 [2025-03-08 02:08:04,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:04,705 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 470 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:04,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 301 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76833 states. [2025-03-08 02:08:05,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76833 to 73419. [2025-03-08 02:08:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73419 states, 73418 states have (on average 1.1121250919393064) internal successors, (81650), 73418 states have internal predecessors, (81650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73419 states to 73419 states and 81650 transitions. [2025-03-08 02:08:05,458 INFO L78 Accepts]: Start accepts. Automaton has 73419 states and 81650 transitions. Word has length 365 [2025-03-08 02:08:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:05,458 INFO L471 AbstractCegarLoop]: Abstraction has 73419 states and 81650 transitions. [2025-03-08 02:08:05,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 73419 states and 81650 transitions. [2025-03-08 02:08:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-08 02:08:05,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:05,462 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:08:05,462 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:05,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash 409348945, now seen corresponding path program 1 times [2025-03-08 02:08:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460741699] [2025-03-08 02:08:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:05,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 02:08:05,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 02:08:05,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:05,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-08 02:08:05,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460741699] [2025-03-08 02:08:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460741699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:05,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:05,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936561145] [2025-03-08 02:08:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:05,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:05,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:05,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:05,991 INFO L87 Difference]: Start difference. First operand 73419 states and 81650 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:07,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:07,738 INFO L93 Difference]: Finished difference Result 163003 states and 181528 transitions. [2025-03-08 02:08:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:07,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 381 [2025-03-08 02:08:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:07,846 INFO L225 Difference]: With dead ends: 163003 [2025-03-08 02:08:07,846 INFO L226 Difference]: Without dead ends: 88309 [2025-03-08 02:08:07,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:07,894 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 388 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:07,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 819 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:08:07,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88309 states. [2025-03-08 02:08:08,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88309 to 72958. [2025-03-08 02:08:08,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72958 states, 72957 states have (on average 1.110955768466357) internal successors, (81052), 72957 states have internal predecessors, (81052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72958 states to 72958 states and 81052 transitions. [2025-03-08 02:08:08,836 INFO L78 Accepts]: Start accepts. Automaton has 72958 states and 81052 transitions. Word has length 381 [2025-03-08 02:08:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:08,837 INFO L471 AbstractCegarLoop]: Abstraction has 72958 states and 81052 transitions. [2025-03-08 02:08:08,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 72958 states and 81052 transitions. [2025-03-08 02:08:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2025-03-08 02:08:08,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:08,844 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:08:08,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1481909436, now seen corresponding path program 1 times [2025-03-08 02:08:08,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:08,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654446936] [2025-03-08 02:08:08,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:08,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:08,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 399 statements into 1 equivalence classes. [2025-03-08 02:08:08,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 399 of 399 statements. [2025-03-08 02:08:08,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:08,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-03-08 02:08:09,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:09,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654446936] [2025-03-08 02:08:09,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654446936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:09,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:09,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:09,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325795100] [2025-03-08 02:08:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:09,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:09,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:09,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:09,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:09,094 INFO L87 Difference]: Start difference. First operand 72958 states and 81052 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:11,003 INFO L93 Difference]: Finished difference Result 166355 states and 185074 transitions. [2025-03-08 02:08:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 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 399 [2025-03-08 02:08:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:11,106 INFO L225 Difference]: With dead ends: 166355 [2025-03-08 02:08:11,106 INFO L226 Difference]: Without dead ends: 92969 [2025-03-08 02:08:11,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:11,132 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 409 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:11,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 362 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:08:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92969 states. [2025-03-08 02:08:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92969 to 88271. [2025-03-08 02:08:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88271 states, 88270 states have (on average 1.1049280616290926) internal successors, (97532), 88270 states have internal predecessors, (97532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88271 states to 88271 states and 97532 transitions. [2025-03-08 02:08:12,036 INFO L78 Accepts]: Start accepts. Automaton has 88271 states and 97532 transitions. Word has length 399 [2025-03-08 02:08:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 88271 states and 97532 transitions. [2025-03-08 02:08:12,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:12,036 INFO L276 IsEmpty]: Start isEmpty. Operand 88271 states and 97532 transitions. [2025-03-08 02:08:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-08 02:08:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:12,041 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:08:12,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash 2036501454, now seen corresponding path program 1 times [2025-03-08 02:08:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684903575] [2025-03-08 02:08:12,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:12,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-08 02:08:12,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-08 02:08:12,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:12,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-08 02:08:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:12,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684903575] [2025-03-08 02:08:12,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684903575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:12,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:12,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:12,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710410008] [2025-03-08 02:08:12,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:12,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:12,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:12,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:12,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:12,150 INFO L87 Difference]: Start difference. First operand 88271 states and 97532 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:13,767 INFO L93 Difference]: Finished difference Result 185045 states and 204010 transitions. [2025-03-08 02:08:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:13,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 403 [2025-03-08 02:08:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:13,874 INFO L225 Difference]: With dead ends: 185045 [2025-03-08 02:08:13,874 INFO L226 Difference]: Without dead ends: 96775 [2025-03-08 02:08:13,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:13,932 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 388 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:13,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 315 Invalid, 1379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:08:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96775 states. [2025-03-08 02:08:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96775 to 91669. [2025-03-08 02:08:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91669 states, 91668 states have (on average 1.1009076231618449) internal successors, (100918), 91668 states have internal predecessors, (100918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91669 states to 91669 states and 100918 transitions. [2025-03-08 02:08:15,267 INFO L78 Accepts]: Start accepts. Automaton has 91669 states and 100918 transitions. Word has length 403 [2025-03-08 02:08:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:15,267 INFO L471 AbstractCegarLoop]: Abstraction has 91669 states and 100918 transitions. [2025-03-08 02:08:15,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:15,267 INFO L276 IsEmpty]: Start isEmpty. Operand 91669 states and 100918 transitions. [2025-03-08 02:08:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-08 02:08:15,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:15,274 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, 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, 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] [2025-03-08 02:08:15,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:08:15,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:15,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:15,274 INFO L85 PathProgramCache]: Analyzing trace with hash -324727151, now seen corresponding path program 1 times [2025-03-08 02:08:15,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:15,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409293426] [2025-03-08 02:08:15,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:15,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:15,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 02:08:15,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 02:08:15,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:15,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 367 proven. 51 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:08:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:15,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409293426] [2025-03-08 02:08:15,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409293426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:15,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167631683] [2025-03-08 02:08:15,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:15,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:15,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:15,945 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:15,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:08:16,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-08 02:08:16,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-08 02:08:16,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:16,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:16,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:08:16,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-08 02:08:16,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:08:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 687 backedges. 431 proven. 82 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-03-08 02:08:17,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167631683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:08:17,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:08:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:08:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464152386] [2025-03-08 02:08:17,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:08:17,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:08:17,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:17,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:08:17,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:08:17,071 INFO L87 Difference]: Start difference. First operand 91669 states and 100918 transitions. Second operand has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:25,232 INFO L93 Difference]: Finished difference Result 237420 states and 260035 transitions. [2025-03-08 02:08:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 02:08:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 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 433 [2025-03-08 02:08:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:25,417 INFO L225 Difference]: With dead ends: 237420 [2025-03-08 02:08:25,417 INFO L226 Difference]: Without dead ends: 139369 [2025-03-08 02:08:25,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 870 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2025-03-08 02:08:25,482 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 9066 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 7665 mSolverCounterSat, 2920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9066 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 10585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2920 IncrementalHoareTripleChecker+Valid, 7665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:25,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9066 Valid, 306 Invalid, 10585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2920 Valid, 7665 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-08 02:08:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139369 states. [2025-03-08 02:08:26,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139369 to 116301. [2025-03-08 02:08:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116301 states, 116300 states have (on average 1.0760705073086845) internal successors, (125147), 116300 states have internal predecessors, (125147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116301 states to 116301 states and 125147 transitions. [2025-03-08 02:08:26,963 INFO L78 Accepts]: Start accepts. Automaton has 116301 states and 125147 transitions. Word has length 433 [2025-03-08 02:08:26,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:26,963 INFO L471 AbstractCegarLoop]: Abstraction has 116301 states and 125147 transitions. [2025-03-08 02:08:26,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:26,964 INFO L276 IsEmpty]: Start isEmpty. Operand 116301 states and 125147 transitions. [2025-03-08 02:08:26,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2025-03-08 02:08:26,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:26,971 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:08:26,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:08:27,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:27,172 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -625443690, now seen corresponding path program 1 times [2025-03-08 02:08:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:27,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231340429] [2025-03-08 02:08:27,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:27,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:27,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 498 statements into 1 equivalence classes. [2025-03-08 02:08:27,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 498 of 498 statements. [2025-03-08 02:08:27,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:27,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-08 02:08:27,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:27,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231340429] [2025-03-08 02:08:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231340429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:27,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:27,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:27,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194034878] [2025-03-08 02:08:27,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:27,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:27,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:27,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:27,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:27,386 INFO L87 Difference]: Start difference. First operand 116301 states and 125147 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:29,548 INFO L93 Difference]: Finished difference Result 235578 states and 253447 transitions. [2025-03-08 02:08:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 498 [2025-03-08 02:08:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:29,684 INFO L225 Difference]: With dead ends: 235578 [2025-03-08 02:08:29,684 INFO L226 Difference]: Without dead ends: 119279 [2025-03-08 02:08:29,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:29,729 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 366 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:29,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 325 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:08:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119279 states. [2025-03-08 02:08:30,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119279 to 108205. [2025-03-08 02:08:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108205 states, 108204 states have (on average 1.0754593175853018) internal successors, (116369), 108204 states have internal predecessors, (116369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108205 states to 108205 states and 116369 transitions. [2025-03-08 02:08:31,233 INFO L78 Accepts]: Start accepts. Automaton has 108205 states and 116369 transitions. Word has length 498 [2025-03-08 02:08:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:31,234 INFO L471 AbstractCegarLoop]: Abstraction has 108205 states and 116369 transitions. [2025-03-08 02:08:31,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 108205 states and 116369 transitions. [2025-03-08 02:08:31,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-03-08 02:08:31,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:31,246 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:31,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:08:31,246 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:31,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash -315622745, now seen corresponding path program 1 times [2025-03-08 02:08:31,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:31,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860857708] [2025-03-08 02:08:31,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:31,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:31,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-08 02:08:31,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-08 02:08:31,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:31,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:08:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860857708] [2025-03-08 02:08:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860857708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549976593] [2025-03-08 02:08:31,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:31,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:31,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:08:31,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-03-08 02:08:31,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-03-08 02:08:31,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:31,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:31,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:08:31,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:08:32,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:08:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 265 proven. 51 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:08:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549976593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:08:33,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:08:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 02:08:33,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237700847] [2025-03-08 02:08:33,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:08:33,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 02:08:33,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:33,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 02:08:33,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:08:33,840 INFO L87 Difference]: Start difference. First operand 108205 states and 116369 transitions. Second operand has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:40,461 INFO L93 Difference]: Finished difference Result 260725 states and 279430 transitions. [2025-03-08 02:08:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 02:08:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 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 511 [2025-03-08 02:08:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:40,661 INFO L225 Difference]: With dead ends: 260725 [2025-03-08 02:08:40,661 INFO L226 Difference]: Without dead ends: 150394 [2025-03-08 02:08:40,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1022 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 02:08:40,739 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 2433 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 7451 mSolverCounterSat, 1761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 9212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1761 IncrementalHoareTripleChecker+Valid, 7451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:40,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 285 Invalid, 9212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1761 Valid, 7451 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-08 02:08:40,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150394 states. [2025-03-08 02:08:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150394 to 118839. [2025-03-08 02:08:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118839 states, 118838 states have (on average 1.0636244298961612) internal successors, (126399), 118838 states have internal predecessors, (126399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118839 states to 118839 states and 126399 transitions. [2025-03-08 02:08:42,315 INFO L78 Accepts]: Start accepts. Automaton has 118839 states and 126399 transitions. Word has length 511 [2025-03-08 02:08:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:42,315 INFO L471 AbstractCegarLoop]: Abstraction has 118839 states and 126399 transitions. [2025-03-08 02:08:42,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 140.125) internal successors, (1121), 8 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:42,315 INFO L276 IsEmpty]: Start isEmpty. Operand 118839 states and 126399 transitions. [2025-03-08 02:08:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2025-03-08 02:08:42,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:42,324 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:42,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:08:42,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:08:42,525 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:42,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1978374147, now seen corresponding path program 1 times [2025-03-08 02:08:42,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:42,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392817727] [2025-03-08 02:08:42,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:42,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:42,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 544 statements into 1 equivalence classes. [2025-03-08 02:08:42,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 544 of 544 statements. [2025-03-08 02:08:42,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:42,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:42,991 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:08:42,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:42,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392817727] [2025-03-08 02:08:42,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392817727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:42,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:42,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940683748] [2025-03-08 02:08:42,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:42,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:42,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:42,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:42,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:42,992 INFO L87 Difference]: Start difference. First operand 118839 states and 126399 transitions. Second operand has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:44,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:44,858 INFO L93 Difference]: Finished difference Result 248758 states and 264552 transitions. [2025-03-08 02:08:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:44,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 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-08 02:08:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:45,021 INFO L225 Difference]: With dead ends: 248758 [2025-03-08 02:08:45,021 INFO L226 Difference]: Without dead ends: 129921 [2025-03-08 02:08:45,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:45,092 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 408 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:45,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 271 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:08:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129921 states. [2025-03-08 02:08:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129921 to 128623. [2025-03-08 02:08:46,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128623 states, 128622 states have (on average 1.0617001757086657) internal successors, (136558), 128622 states have internal predecessors, (136558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128623 states to 128623 states and 136558 transitions. [2025-03-08 02:08:46,936 INFO L78 Accepts]: Start accepts. Automaton has 128623 states and 136558 transitions. Word has length 544 [2025-03-08 02:08:46,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:46,937 INFO L471 AbstractCegarLoop]: Abstraction has 128623 states and 136558 transitions. [2025-03-08 02:08:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 128623 states and 136558 transitions. [2025-03-08 02:08:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 02:08:46,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:46,949 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:08:46,949 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:46,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:46,949 INFO L85 PathProgramCache]: Analyzing trace with hash 915252142, now seen corresponding path program 1 times [2025-03-08 02:08:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:46,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446101650] [2025-03-08 02:08:46,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:46,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:46,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 02:08:47,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 02:08:47,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:47,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-08 02:08:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446101650] [2025-03-08 02:08:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446101650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:08:47,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:08:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623175651] [2025-03-08 02:08:47,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:47,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:47,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:08:47,171 INFO L87 Difference]: Start difference. First operand 128623 states and 136558 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)