./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label54.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/Problem16_label54.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 1f271bd641b0ac28243f0a51e3dae55ecbde20fa8802930640f9a6479994a658 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:06:50,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:06:50,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:06:50,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:06:50,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:06:50,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:06:50,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:06:50,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:06:50,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:06:50,768 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:06:50,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:06:50,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:06:50,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:06:50,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:06:50,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:06:50,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:06:50,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:06:50,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:06:50,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:06:50,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:06:50,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:06:50,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:06:50,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:06:50,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:06:50,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:06:50,771 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:06:50,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:06:50,771 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 -> 1f271bd641b0ac28243f0a51e3dae55ecbde20fa8802930640f9a6479994a658 [2025-03-08 02:06:50,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:06:50,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:06:51,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:06:51,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:06:51,003 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:06:51,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label54.c [2025-03-08 02:06:52,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ac18c4/83baec52157f46e79eb334809399143d/FLAG3a68c795a [2025-03-08 02:06:52,465 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:06:52,466 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label54.c [2025-03-08 02:06:52,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ac18c4/83baec52157f46e79eb334809399143d/FLAG3a68c795a [2025-03-08 02:06:52,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da4ac18c4/83baec52157f46e79eb334809399143d [2025-03-08 02:06:52,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:06:52,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:06:52,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:06:52,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:06:52,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:06:52,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:52" (1/1) ... [2025-03-08 02:06:52,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbdfd4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:52, skipping insertion in model container [2025-03-08 02:06:52,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:52" (1/1) ... [2025-03-08 02:06:52,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:06:52,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label54.c[2804,2817] [2025-03-08 02:06:52,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:06:52,978 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:06:52,993 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label54.c[2804,2817] [2025-03-08 02:06:53,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:06:53,126 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:06:53,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53 WrapperNode [2025-03-08 02:06:53,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:06:53,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:06:53,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:06:53,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:06:53,133 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:06:53" (1/1) ... [2025-03-08 02:06:53,154 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:06:53" (1/1) ... [2025-03-08 02:06:53,251 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:06:53,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:06:53,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:06:53,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:06:53,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:06:53,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,316 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:06:53,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:06:53,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:06:53,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:06:53,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:06:53,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (1/1) ... [2025-03-08 02:06:53,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:06:53,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:53,427 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:06:53,432 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:06:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:06:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:06:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:06:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:06:53,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:06:53,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:06:55,128 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:06:55,183 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:06:55,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:06:55,203 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:06:55,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:06:55,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:55 BoogieIcfgContainer [2025-03-08 02:06:55,204 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:06:55,206 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:06:55,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:06:55,209 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:06:55,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:06:52" (1/3) ... [2025-03-08 02:06:55,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4867e26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:55, skipping insertion in model container [2025-03-08 02:06:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:53" (2/3) ... [2025-03-08 02:06:55,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4867e26e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:55, skipping insertion in model container [2025-03-08 02:06:55,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:55" (3/3) ... [2025-03-08 02:06:55,211 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label54.c [2025-03-08 02:06:55,222 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:06:55,224 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label54.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:06:55,279 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:06:55,289 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;@20bc753e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:06:55,289 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:06:55,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:55,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 02:06:55,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:55,301 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] [2025-03-08 02:06:55,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:55,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:55,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1007997470, now seen corresponding path program 1 times [2025-03-08 02:06:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:55,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302741991] [2025-03-08 02:06:55,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:55,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:55,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 02:06:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 02:06:55,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:55,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:55,535 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:06:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302741991] [2025-03-08 02:06:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302741991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654772680] [2025-03-08 02:06:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:55,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:55,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:55,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:55,566 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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:06:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:56,911 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:06:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:56,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-08 02:06:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:56,921 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:06:56,921 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:06:56,926 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:06:56,927 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 335 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:56,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:06:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:06:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:06:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states 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:06:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-08 02:06:56,990 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 25 [2025-03-08 02:06:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:56,990 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-08 02:06:56,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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:06:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-08 02:06:56,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 02:06:56,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:56,992 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:56,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:06:56,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:56,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1679406885, now seen corresponding path program 1 times [2025-03-08 02:06:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:56,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008062864] [2025-03-08 02:06:56,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:56,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:57,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 02:06:57,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 02:06:57,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:57,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:06:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:57,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008062864] [2025-03-08 02:06:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008062864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:57,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982501765] [2025-03-08 02:06:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:57,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:57,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:57,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:57,209 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:58,327 INFO L93 Difference]: Finished difference Result 1980 states and 3133 transitions. [2025-03-08 02:06:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-08 02:06:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:58,333 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 02:06:58,333 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 02:06:58,335 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:06:58,336 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:58,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 79 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:06:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 02:06:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-08 02:06:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5056861258529188) internal successors, (1986), 1319 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states 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:06:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1986 transitions. [2025-03-08 02:06:58,364 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1986 transitions. Word has length 96 [2025-03-08 02:06:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:58,365 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1986 transitions. [2025-03-08 02:06:58,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1986 transitions. [2025-03-08 02:06:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-08 02:06:58,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:58,372 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:06:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:06:58,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:58,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1517826518, now seen corresponding path program 1 times [2025-03-08 02:06:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558932668] [2025-03-08 02:06:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:58,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-08 02:06:58,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-08 02:06:58,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:58,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 02:06:58,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:58,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558932668] [2025-03-08 02:06:58,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558932668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:58,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123025173] [2025-03-08 02:06:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:58,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:58,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:58,622 INFO L87 Difference]: Start difference. First operand 1320 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:06:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:59,630 INFO L93 Difference]: Finished difference Result 3954 states and 5953 transitions. [2025-03-08 02:06:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:59,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 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 167 [2025-03-08 02:06:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:59,638 INFO L225 Difference]: With dead ends: 3954 [2025-03-08 02:06:59,639 INFO L226 Difference]: Without dead ends: 2636 [2025-03-08 02:06:59,640 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:06:59,641 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:59,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 205 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:06:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-08 02:06:59,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-08 02:06:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.323719165085389) internal successors, (3488), 2635 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states 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:06:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3488 transitions. [2025-03-08 02:06:59,680 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3488 transitions. Word has length 167 [2025-03-08 02:06:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3488 transitions. [2025-03-08 02:06:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states 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:06:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3488 transitions. [2025-03-08 02:06:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 02:06:59,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:59,683 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:06:59,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:06:59,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:59,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash -227325718, now seen corresponding path program 1 times [2025-03-08 02:06:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:59,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396162260] [2025-03-08 02:06:59,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:59,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 02:06:59,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 02:06:59,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:59,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:06:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:59,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396162260] [2025-03-08 02:06:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396162260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:59,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:59,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:59,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286442490] [2025-03-08 02:06:59,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:59,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:59,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:59,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:59,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:59,896 INFO L87 Difference]: Start difference. First operand 2636 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:00,878 INFO L93 Difference]: Finished difference Result 6586 states and 8891 transitions. [2025-03-08 02:07:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:00,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-03-08 02:07:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:00,891 INFO L225 Difference]: With dead ends: 6586 [2025-03-08 02:07:00,891 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:07:00,893 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:00,895 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:00,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:07:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:07:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2965. [2025-03-08 02:07:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3286099865047234) internal successors, (3938), 2964 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states 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:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3938 transitions. [2025-03-08 02:07:00,943 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3938 transitions. Word has length 191 [2025-03-08 02:07:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:00,944 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3938 transitions. [2025-03-08 02:07:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states 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:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3938 transitions. [2025-03-08 02:07:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-08 02:07:00,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:00,947 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:07:00,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:00,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1705759837, now seen corresponding path program 1 times [2025-03-08 02:07:00,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:00,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491756978] [2025-03-08 02:07:00,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:00,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-08 02:07:00,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-08 02:07:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:01,186 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 02:07:01,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:01,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491756978] [2025-03-08 02:07:01,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491756978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:01,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:01,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:01,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647521478] [2025-03-08 02:07:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:01,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:01,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:01,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:01,188 INFO L87 Difference]: Start difference. First operand 2965 states and 3938 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:02,035 INFO L93 Difference]: Finished difference Result 7244 states and 9442 transitions. [2025-03-08 02:07:02,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:02,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 334 [2025-03-08 02:07:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:02,046 INFO L225 Difference]: With dead ends: 7244 [2025-03-08 02:07:02,047 INFO L226 Difference]: Without dead ends: 4281 [2025-03-08 02:07:02,051 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:02,051 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:02,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:07:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-08 02:07:02,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-08 02:07:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2121495327102805) internal successors, (5188), 4280 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states 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:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5188 transitions. [2025-03-08 02:07:02,122 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5188 transitions. Word has length 334 [2025-03-08 02:07:02,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:02,122 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5188 transitions. [2025-03-08 02:07:02,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:02,122 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5188 transitions. [2025-03-08 02:07:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-08 02:07:02,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:02,129 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:07:02,129 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 370017056, now seen corresponding path program 1 times [2025-03-08 02:07:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047371135] [2025-03-08 02:07:02,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:02,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-08 02:07:02,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-08 02:07:02,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:02,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 02:07:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047371135] [2025-03-08 02:07:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047371135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:07:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422587858] [2025-03-08 02:07:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:02,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:02,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:02,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:02,710 INFO L87 Difference]: Start difference. First operand 4281 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:03,519 INFO L93 Difference]: Finished difference Result 9218 states and 11086 transitions. [2025-03-08 02:07:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:03,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 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 448 [2025-03-08 02:07:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:03,530 INFO L225 Difference]: With dead ends: 9218 [2025-03-08 02:07:03,530 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:07:03,534 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:03,534 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:03,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:07:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:07:03,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:07:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.191170514378291) internal successors, (5882), 4938 states have internal predecessors, (5882), 0 states have call successors, (0), 0 states 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:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5882 transitions. [2025-03-08 02:07:03,592 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5882 transitions. Word has length 448 [2025-03-08 02:07:03,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:03,593 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5882 transitions. [2025-03-08 02:07:03,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5882 transitions. [2025-03-08 02:07:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-08 02:07:03,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:03,600 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:07:03,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:07:03,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash -807452773, now seen corresponding path program 1 times [2025-03-08 02:07:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031084009] [2025-03-08 02:07:03,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-08 02:07:03,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-08 02:07:03,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:03,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-03-08 02:07:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031084009] [2025-03-08 02:07:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031084009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:07:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297718353] [2025-03-08 02:07:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:04,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:07:04,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:04,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:07:04,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:04,210 INFO L87 Difference]: Start difference. First operand 4939 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:05,468 INFO L93 Difference]: Finished difference Result 9077 states and 10915 transitions. [2025-03-08 02:07:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 02:07:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 535 [2025-03-08 02:07:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:05,478 INFO L225 Difference]: With dead ends: 9077 [2025-03-08 02:07:05,478 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 02:07:05,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:05,482 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:05,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:07:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 02:07:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-08 02:07:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0735517465827729) internal successors, (4948), 4609 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states 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:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4948 transitions. [2025-03-08 02:07:05,534 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4948 transitions. Word has length 535 [2025-03-08 02:07:05,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:05,534 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4948 transitions. [2025-03-08 02:07:05,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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:05,534 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4948 transitions. [2025-03-08 02:07:05,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 02:07:05,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:05,543 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:07:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:07:05,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:05,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -163599619, now seen corresponding path program 1 times [2025-03-08 02:07:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039690016] [2025-03-08 02:07:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:05,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 02:07:05,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 02:07:05,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-08 02:07:05,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:05,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039690016] [2025-03-08 02:07:05,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039690016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:05,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:05,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:05,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680060450] [2025-03-08 02:07:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:05,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:05,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:05,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:05,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:05,969 INFO L87 Difference]: Start difference. First operand 4610 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:06,704 INFO L93 Difference]: Finished difference Result 10863 states and 11778 transitions. [2025-03-08 02:07:06,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:06,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 563 [2025-03-08 02:07:06,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:06,718 INFO L225 Difference]: With dead ends: 10863 [2025-03-08 02:07:06,718 INFO L226 Difference]: Without dead ends: 6913 [2025-03-08 02:07:06,721 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:06,722 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:06,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:07:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-08 02:07:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-03-08 02:07:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.058332067446453) internal successors, (6967), 6583 states have internal predecessors, (6967), 0 states have call successors, (0), 0 states 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:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6967 transitions. [2025-03-08 02:07:06,788 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6967 transitions. Word has length 563 [2025-03-08 02:07:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:06,789 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6967 transitions. [2025-03-08 02:07:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6967 transitions. [2025-03-08 02:07:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-03-08 02:07:06,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:06,798 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:07:06,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2117590530, now seen corresponding path program 1 times [2025-03-08 02:07:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:06,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316883307] [2025-03-08 02:07:06,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:06,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-03-08 02:07:06,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-03-08 02:07:06,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:06,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 697 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-08 02:07:07,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:07,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316883307] [2025-03-08 02:07:07,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316883307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:07,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:07,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:07,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307151808] [2025-03-08 02:07:07,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:07,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:07,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:07,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:07,073 INFO L87 Difference]: Start difference. First operand 6584 states and 6967 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:07,768 INFO L93 Difference]: Finished difference Result 14482 states and 15462 transitions. [2025-03-08 02:07:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:07,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 667 [2025-03-08 02:07:07,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:07,782 INFO L225 Difference]: With dead ends: 14482 [2025-03-08 02:07:07,782 INFO L226 Difference]: Without dead ends: 8558 [2025-03-08 02:07:07,788 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:07,788 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 188 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:07,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 54 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-08 02:07:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8229. [2025-03-08 02:07:07,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0630772970345164) internal successors, (8747), 8228 states have internal predecessors, (8747), 0 states have call successors, (0), 0 states 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:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8747 transitions. [2025-03-08 02:07:07,868 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8747 transitions. Word has length 667 [2025-03-08 02:07:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:07,868 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8747 transitions. [2025-03-08 02:07:07,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8747 transitions. [2025-03-08 02:07:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2025-03-08 02:07:07,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:07,880 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:07:07,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:07:07,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:07,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1834192208, now seen corresponding path program 1 times [2025-03-08 02:07:07,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:07,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463355792] [2025-03-08 02:07:07,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:07,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 898 statements into 1 equivalence classes. [2025-03-08 02:07:08,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 898 of 898 statements. [2025-03-08 02:07:08,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:08,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 669 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2025-03-08 02:07:08,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:08,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463355792] [2025-03-08 02:07:08,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463355792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:08,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:08,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:08,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101208998] [2025-03-08 02:07:08,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:08,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:08,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:08,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:08,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:08,335 INFO L87 Difference]: Start difference. First operand 8229 states and 8747 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:08,958 INFO L93 Difference]: Finished difference Result 20075 states and 21474 transitions. [2025-03-08 02:07:08,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:08,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 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 898 [2025-03-08 02:07:08,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:08,974 INFO L225 Difference]: With dead ends: 20075 [2025-03-08 02:07:08,974 INFO L226 Difference]: Without dead ends: 10861 [2025-03-08 02:07:08,980 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:08,981 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:08,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-03-08 02:07:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2025-03-08 02:07:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0519337016574586) internal successors, (11424), 10860 states have internal predecessors, (11424), 0 states have call successors, (0), 0 states 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:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11424 transitions. [2025-03-08 02:07:09,103 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11424 transitions. Word has length 898 [2025-03-08 02:07:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11424 transitions. [2025-03-08 02:07:09,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11424 transitions. [2025-03-08 02:07:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2025-03-08 02:07:09,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:09,120 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:09,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:07:09,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:09,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:09,122 INFO L85 PathProgramCache]: Analyzing trace with hash 948634235, now seen corresponding path program 1 times [2025-03-08 02:07:09,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:09,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510929258] [2025-03-08 02:07:09,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:09,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-03-08 02:07:09,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-03-08 02:07:09,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:09,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2762 backedges. 1939 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2025-03-08 02:07:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510929258] [2025-03-08 02:07:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510929258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733144326] [2025-03-08 02:07:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:09,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:09,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:09,683 INFO L87 Difference]: Start difference. First operand 10861 states and 11424 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:10,291 INFO L93 Difference]: Finished difference Result 24023 states and 25408 transitions. [2025-03-08 02:07:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 1212 [2025-03-08 02:07:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:10,307 INFO L225 Difference]: With dead ends: 24023 [2025-03-08 02:07:10,307 INFO L226 Difference]: Without dead ends: 13822 [2025-03-08 02:07:10,315 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:10,315 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:10,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 432 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-03-08 02:07:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13493. [2025-03-08 02:07:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0455825674473762) internal successors, (14107), 13492 states have internal predecessors, (14107), 0 states have call successors, (0), 0 states 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:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14107 transitions. [2025-03-08 02:07:10,428 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14107 transitions. Word has length 1212 [2025-03-08 02:07:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:10,429 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14107 transitions. [2025-03-08 02:07:10,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14107 transitions. [2025-03-08 02:07:10,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-03-08 02:07:10,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:10,444 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:10,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:07:10,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:10,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:10,445 INFO L85 PathProgramCache]: Analyzing trace with hash -770109595, now seen corresponding path program 1 times [2025-03-08 02:07:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287659789] [2025-03-08 02:07:10,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:10,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-03-08 02:07:10,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-03-08 02:07:10,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:10,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2768 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-08 02:07:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287659789] [2025-03-08 02:07:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287659789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:10,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:10,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982487545] [2025-03-08 02:07:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:10,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:11,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:11,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:11,000 INFO L87 Difference]: Start difference. First operand 13493 states and 14107 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:11,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:11,627 INFO L93 Difference]: Finished difference Result 28958 states and 30337 transitions. [2025-03-08 02:07:11,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:11,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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 1213 [2025-03-08 02:07:11,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:11,646 INFO L225 Difference]: With dead ends: 28958 [2025-03-08 02:07:11,646 INFO L226 Difference]: Without dead ends: 14151 [2025-03-08 02:07:11,658 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:11,658 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 170 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:11,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 412 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-08 02:07:11,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 14151. [2025-03-08 02:07:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.036183745583039) internal successors, (14662), 14150 states have internal predecessors, (14662), 0 states have call successors, (0), 0 states 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:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14662 transitions. [2025-03-08 02:07:11,769 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14662 transitions. Word has length 1213 [2025-03-08 02:07:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14662 transitions. [2025-03-08 02:07:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14662 transitions. [2025-03-08 02:07:11,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1330 [2025-03-08 02:07:11,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:11,786 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:11,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:07:11,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:11,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:11,787 INFO L85 PathProgramCache]: Analyzing trace with hash -632446716, now seen corresponding path program 1 times [2025-03-08 02:07:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:11,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352678489] [2025-03-08 02:07:11,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:11,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:11,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1329 statements into 1 equivalence classes. [2025-03-08 02:07:11,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1329 of 1329 statements. [2025-03-08 02:07:11,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:11,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:13,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 1176 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-03-08 02:07:13,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:13,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352678489] [2025-03-08 02:07:13,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352678489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:13,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:07:13,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705795640] [2025-03-08 02:07:13,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:13,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:13,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:13,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:13,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:13,005 INFO L87 Difference]: Start difference. First operand 14151 states and 14662 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:13,924 INFO L93 Difference]: Finished difference Result 31919 states and 33045 transitions. [2025-03-08 02:07:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1329 [2025-03-08 02:07:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:13,947 INFO L225 Difference]: With dead ends: 31919 [2025-03-08 02:07:13,947 INFO L226 Difference]: Without dead ends: 18428 [2025-03-08 02:07:13,958 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:13,958 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 356 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:13,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 65 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:07:13,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-03-08 02:07:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 13493. [2025-03-08 02:07:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0350578120367626) internal successors, (13965), 13492 states have internal predecessors, (13965), 0 states have call successors, (0), 0 states 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:14,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13965 transitions. [2025-03-08 02:07:14,126 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13965 transitions. Word has length 1329 [2025-03-08 02:07:14,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:14,127 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13965 transitions. [2025-03-08 02:07:14,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:14,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13965 transitions. [2025-03-08 02:07:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1369 [2025-03-08 02:07:14,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:14,143 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:14,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:07:14,143 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1749790037, now seen corresponding path program 1 times [2025-03-08 02:07:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:14,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856295711] [2025-03-08 02:07:14,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:14,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:14,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1368 statements into 1 equivalence classes. [2025-03-08 02:07:14,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1368 of 1368 statements. [2025-03-08 02:07:14,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:14,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2924 backedges. 2147 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2025-03-08 02:07:15,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:15,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856295711] [2025-03-08 02:07:15,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856295711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:15,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:15,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:07:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699071089] [2025-03-08 02:07:15,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:15,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:15,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:15,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:15,326 INFO L87 Difference]: Start difference. First operand 13493 states and 13965 transitions. Second operand has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:16,234 INFO L93 Difference]: Finished difference Result 26336 states and 27271 transitions. [2025-03-08 02:07:16,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:07:16,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 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 1368 [2025-03-08 02:07:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:16,253 INFO L225 Difference]: With dead ends: 26336 [2025-03-08 02:07:16,253 INFO L226 Difference]: Without dead ends: 13503 [2025-03-08 02:07:16,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:16,264 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:16,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:07:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13503 states. [2025-03-08 02:07:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13503 to 13493. [2025-03-08 02:07:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.034761340053365) internal successors, (13961), 13492 states have internal predecessors, (13961), 0 states have call successors, (0), 0 states 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:16,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13961 transitions. [2025-03-08 02:07:16,363 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13961 transitions. Word has length 1368 [2025-03-08 02:07:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:16,364 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13961 transitions. [2025-03-08 02:07:16,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states 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:16,364 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13961 transitions. [2025-03-08 02:07:16,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1384 [2025-03-08 02:07:16,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:16,381 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:07:16,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -386576149, now seen corresponding path program 1 times [2025-03-08 02:07:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401727817] [2025-03-08 02:07:16,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:16,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1383 statements into 1 equivalence classes. [2025-03-08 02:07:16,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1383 of 1383 statements. [2025-03-08 02:07:16,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:16,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 2211 proven. 0 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2025-03-08 02:07:16,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:16,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401727817] [2025-03-08 02:07:16,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401727817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:16,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:16,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712906331] [2025-03-08 02:07:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:16,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:16,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:16,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:16,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:16,911 INFO L87 Difference]: Start difference. First operand 13493 states and 13961 transitions. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:17,441 INFO L93 Difference]: Finished difference Result 26326 states and 27253 transitions. [2025-03-08 02:07:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:17,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 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 1383 [2025-03-08 02:07:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:17,455 INFO L225 Difference]: With dead ends: 26326 [2025-03-08 02:07:17,455 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:07:17,464 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:17,464 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:17,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 418 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:17,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:07:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13164. [2025-03-08 02:07:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0275013294841602) internal successors, (13525), 13163 states have internal predecessors, (13525), 0 states have call successors, (0), 0 states 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:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13525 transitions. [2025-03-08 02:07:17,565 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13525 transitions. Word has length 1383 [2025-03-08 02:07:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13525 transitions. [2025-03-08 02:07:17,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13525 transitions. [2025-03-08 02:07:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1501 [2025-03-08 02:07:17,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:17,581 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:17,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:07:17,582 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:17,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:17,582 INFO L85 PathProgramCache]: Analyzing trace with hash -730687064, now seen corresponding path program 1 times [2025-03-08 02:07:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886499088] [2025-03-08 02:07:17,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:17,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:17,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1500 statements into 1 equivalence classes. [2025-03-08 02:07:17,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1500 of 1500 statements. [2025-03-08 02:07:17,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:17,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 2283 proven. 897 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:07:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886499088] [2025-03-08 02:07:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886499088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143321408] [2025-03-08 02:07:20,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:20,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:20,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:20,084 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:20,086 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:20,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1500 statements into 1 equivalence classes. [2025-03-08 02:07:20,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1500 of 1500 statements. [2025-03-08 02:07:20,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:20,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:20,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1706 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:07:20,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 1850 proven. 201 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-03-08 02:07:22,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 1850 proven. 201 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-03-08 02:07:25,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143321408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:07:25,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:07:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2025-03-08 02:07:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079074674] [2025-03-08 02:07:25,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:07:25,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 02:07:25,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:25,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 02:07:25,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 02:07:25,518 INFO L87 Difference]: Start difference. First operand 13164 states and 13525 transitions. Second operand has 11 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:28,764 INFO L93 Difference]: Finished difference Result 26328 states and 27048 transitions. [2025-03-08 02:07:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 02:07:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 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 1500 [2025-03-08 02:07:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:28,777 INFO L225 Difference]: With dead ends: 26328 [2025-03-08 02:07:28,778 INFO L226 Difference]: Without dead ends: 13824 [2025-03-08 02:07:28,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3023 GetRequests, 3006 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-08 02:07:28,787 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2383 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6747 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2383 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 6981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 6747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:28,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2383 Valid, 93 Invalid, 6981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 6747 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-08 02:07:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13824 states. [2025-03-08 02:07:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13824 to 13164. [2025-03-08 02:07:28,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0213477170857708) internal successors, (13444), 13163 states have internal predecessors, (13444), 0 states have call successors, (0), 0 states 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:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13444 transitions. [2025-03-08 02:07:28,882 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13444 transitions. Word has length 1500 [2025-03-08 02:07:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13444 transitions. [2025-03-08 02:07:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 184.63636363636363) internal successors, (2031), 11 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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:28,883 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13444 transitions. [2025-03-08 02:07:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1571 [2025-03-08 02:07:28,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:28,920 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:28,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 02:07:29,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 02:07:29,120 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:29,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:29,121 INFO L85 PathProgramCache]: Analyzing trace with hash -880605963, now seen corresponding path program 1 times [2025-03-08 02:07:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128397515] [2025-03-08 02:07:29,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:29,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:29,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1570 statements into 1 equivalence classes. [2025-03-08 02:07:29,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1570 of 1570 statements. [2025-03-08 02:07:29,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:29,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 2166 proven. 0 refuted. 0 times theorem prover too weak. 2574 trivial. 0 not checked. [2025-03-08 02:07:30,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128397515] [2025-03-08 02:07:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128397515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:30,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:30,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937484272] [2025-03-08 02:07:30,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:30,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:30,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:30,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:30,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:30,182 INFO L87 Difference]: Start difference. First operand 13164 states and 13444 transitions. Second operand has 4 states, 4 states have (on average 172.25) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:30,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:30,770 INFO L93 Difference]: Finished difference Result 26326 states and 26891 transitions. [2025-03-08 02:07:30,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 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 1570 [2025-03-08 02:07:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:30,781 INFO L225 Difference]: With dead ends: 26326 [2025-03-08 02:07:30,781 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:07:30,788 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:30,788 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 268 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:30,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 97 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:07:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-08 02:07:30,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0211236288170769) internal successors, (13777), 13492 states have internal predecessors, (13777), 0 states have call successors, (0), 0 states 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:30,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13777 transitions. [2025-03-08 02:07:30,878 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13777 transitions. Word has length 1570 [2025-03-08 02:07:30,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:30,879 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13777 transitions. [2025-03-08 02:07:30,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13777 transitions. [2025-03-08 02:07:30,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1632 [2025-03-08 02:07:30,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:30,918 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 02:07:30,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:07:30,919 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:30,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:30,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2057098402, now seen corresponding path program 1 times [2025-03-08 02:07:30,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:30,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346274070] [2025-03-08 02:07:30,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:30,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:31,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1631 statements into 1 equivalence classes. [2025-03-08 02:07:31,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1631 of 1631 statements. [2025-03-08 02:07:31,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:31,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:32,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4976 backedges. 1524 proven. 0 refuted. 0 times theorem prover too weak. 3452 trivial. 0 not checked. [2025-03-08 02:07:32,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:32,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346274070] [2025-03-08 02:07:32,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346274070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:32,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:32,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:07:32,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704936304] [2025-03-08 02:07:32,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:32,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:32,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:32,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:32,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:32,116 INFO L87 Difference]: Start difference. First operand 13493 states and 13777 transitions. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:32,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:32,981 INFO L93 Difference]: Finished difference Result 29287 states and 29893 transitions. [2025-03-08 02:07:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:32,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 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 1631 [2025-03-08 02:07:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:32,994 INFO L225 Difference]: With dead ends: 29287 [2025-03-08 02:07:32,994 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:07:33,002 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:33,002 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 361 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:33,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 21 Invalid, 1627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:07:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:07:33,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 13822. [2025-03-08 02:07:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0198972577961074) internal successors, (14096), 13821 states have internal predecessors, (14096), 0 states have call successors, (0), 0 states 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:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14096 transitions. [2025-03-08 02:07:33,103 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14096 transitions. Word has length 1631 [2025-03-08 02:07:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:33,104 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14096 transitions. [2025-03-08 02:07:33,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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:33,104 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14096 transitions. [2025-03-08 02:07:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1866 [2025-03-08 02:07:33,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:33,124 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 02:07:33,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:07:33,124 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:33,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -871495530, now seen corresponding path program 1 times [2025-03-08 02:07:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687962214] [2025-03-08 02:07:33,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:33,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1865 statements into 1 equivalence classes. [2025-03-08 02:07:33,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1865 of 1865 statements. [2025-03-08 02:07:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7300 backedges. 1318 proven. 0 refuted. 0 times theorem prover too weak. 5982 trivial. 0 not checked. [2025-03-08 02:07:34,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:34,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687962214] [2025-03-08 02:07:34,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687962214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:34,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630064916] [2025-03-08 02:07:34,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:34,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:34,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:34,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:34,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:34,295 INFO L87 Difference]: Start difference. First operand 13822 states and 14096 transitions. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:34,911 INFO L93 Difference]: Finished difference Result 29616 states and 30246 transitions. [2025-03-08 02:07:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 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 1865 [2025-03-08 02:07:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:34,925 INFO L225 Difference]: With dead ends: 29616 [2025-03-08 02:07:34,925 INFO L226 Difference]: Without dead ends: 16454 [2025-03-08 02:07:34,932 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:34,932 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:34,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 27 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-03-08 02:07:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 15467. [2025-03-08 02:07:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0207552049657314) internal successors, (15787), 15466 states have internal predecessors, (15787), 0 states have call successors, (0), 0 states 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:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15787 transitions. [2025-03-08 02:07:35,033 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15787 transitions. Word has length 1865 [2025-03-08 02:07:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:35,033 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15787 transitions. [2025-03-08 02:07:35,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15787 transitions. [2025-03-08 02:07:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1932 [2025-03-08 02:07:35,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:35,085 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 02:07:35,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:07:35,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:35,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:35,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1158618523, now seen corresponding path program 1 times [2025-03-08 02:07:35,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:35,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343901748] [2025-03-08 02:07:35,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:35,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:35,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1931 statements into 1 equivalence classes. [2025-03-08 02:07:35,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1931 of 1931 statements. [2025-03-08 02:07:35,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:35,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 7606 backedges. 3770 proven. 0 refuted. 0 times theorem prover too weak. 3836 trivial. 0 not checked. [2025-03-08 02:07:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343901748] [2025-03-08 02:07:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343901748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:36,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715731725] [2025-03-08 02:07:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:36,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:36,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:36,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:07:36,869 INFO L87 Difference]: Start difference. First operand 15467 states and 15787 transitions. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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:37,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:37,839 INFO L93 Difference]: Finished difference Result 35867 states and 36593 transitions. [2025-03-08 02:07:37,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:37,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 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 1931 [2025-03-08 02:07:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:37,859 INFO L225 Difference]: With dead ends: 35867 [2025-03-08 02:07:37,859 INFO L226 Difference]: Without dead ends: 21060 [2025-03-08 02:07:37,869 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:37,869 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 303 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:37,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 88 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:07:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21060 states. [2025-03-08 02:07:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21060 to 19415. [2025-03-08 02:07:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0202946327392604) internal successors, (19808), 19414 states have internal predecessors, (19808), 0 states have call successors, (0), 0 states 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:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19808 transitions. [2025-03-08 02:07:38,019 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19808 transitions. Word has length 1931 [2025-03-08 02:07:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:38,019 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19808 transitions. [2025-03-08 02:07:38,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19808 transitions. [2025-03-08 02:07:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1934 [2025-03-08 02:07:38,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:38,088 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2025-03-08 02:07:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:07:38,089 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:38,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash 183056512, now seen corresponding path program 1 times [2025-03-08 02:07:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409344165] [2025-03-08 02:07:38,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:38,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1933 statements into 1 equivalence classes. [2025-03-08 02:07:38,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1933 of 1933 statements. [2025-03-08 02:07:38,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:38,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7614 backedges. 3776 proven. 0 refuted. 0 times theorem prover too weak. 3838 trivial. 0 not checked. [2025-03-08 02:07:39,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:39,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409344165] [2025-03-08 02:07:39,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409344165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:39,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:39,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:39,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595431035] [2025-03-08 02:07:39,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:39,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:39,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:39,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:39,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:39,628 INFO L87 Difference]: Start difference. First operand 19415 states and 19808 transitions. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:40,203 INFO L93 Difference]: Finished difference Result 41789 states and 42634 transitions. [2025-03-08 02:07:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:40,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 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 1933 [2025-03-08 02:07:40,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:40,222 INFO L225 Difference]: With dead ends: 41789 [2025-03-08 02:07:40,222 INFO L226 Difference]: Without dead ends: 23034 [2025-03-08 02:07:40,233 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:40,233 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:40,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 54 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2025-03-08 02:07:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 18428. [2025-03-08 02:07:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.020893254463559) internal successors, (18812), 18427 states have internal predecessors, (18812), 0 states have call successors, (0), 0 states 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:40,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18812 transitions. [2025-03-08 02:07:40,381 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18812 transitions. Word has length 1933 [2025-03-08 02:07:40,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:40,382 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18812 transitions. [2025-03-08 02:07:40,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 states 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:40,382 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18812 transitions. [2025-03-08 02:07:40,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1975 [2025-03-08 02:07:40,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:40,403 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:40,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:07:40,403 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:40,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1409315877, now seen corresponding path program 1 times [2025-03-08 02:07:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827676912] [2025-03-08 02:07:40,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:40,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1974 statements into 1 equivalence classes. [2025-03-08 02:07:40,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1974 of 1974 statements. [2025-03-08 02:07:40,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:40,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 8373 backedges. 6256 proven. 41 refuted. 0 times theorem prover too weak. 2076 trivial. 0 not checked. [2025-03-08 02:07:42,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827676912] [2025-03-08 02:07:42,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827676912] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:42,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488963820] [2025-03-08 02:07:42,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:42,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:42,815 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:42,816 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:42,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1974 statements into 1 equivalence classes. [2025-03-08 02:07:43,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1974 of 1974 statements. [2025-03-08 02:07:43,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:43,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:43,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 2294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:43,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 8373 backedges. 4914 proven. 0 refuted. 0 times theorem prover too weak. 3459 trivial. 0 not checked. [2025-03-08 02:07:43,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488963820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:43,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:43,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:07:43,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092860818] [2025-03-08 02:07:43,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:43,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:43,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:43,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:43,589 INFO L87 Difference]: Start difference. First operand 18428 states and 18812 transitions. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:44,140 INFO L93 Difference]: Finished difference Result 36196 states and 36958 transitions. [2025-03-08 02:07:44,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:44,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 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 1974 [2025-03-08 02:07:44,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:44,155 INFO L225 Difference]: With dead ends: 36196 [2025-03-08 02:07:44,155 INFO L226 Difference]: Without dead ends: 18428 [2025-03-08 02:07:44,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1978 GetRequests, 1974 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:07:44,166 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:44,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 424 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-03-08 02:07:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18428. [2025-03-08 02:07:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0204591089162642) internal successors, (18804), 18427 states have internal predecessors, (18804), 0 states have call successors, (0), 0 states 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:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18804 transitions. [2025-03-08 02:07:44,290 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18804 transitions. Word has length 1974 [2025-03-08 02:07:44,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:44,290 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18804 transitions. [2025-03-08 02:07:44,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:44,291 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18804 transitions. [2025-03-08 02:07:44,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1996 [2025-03-08 02:07:44,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:44,312 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:44,320 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:07:44,512 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,SelfDestructingSolverStorable21 [2025-03-08 02:07:44,512 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:44,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:44,513 INFO L85 PathProgramCache]: Analyzing trace with hash -894407510, now seen corresponding path program 1 times [2025-03-08 02:07:44,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:44,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573649357] [2025-03-08 02:07:44,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:44,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:44,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1995 statements into 1 equivalence classes. [2025-03-08 02:07:44,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1995 of 1995 statements. [2025-03-08 02:07:44,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:44,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:46,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8115 backedges. 5768 proven. 153 refuted. 0 times theorem prover too weak. 2194 trivial. 0 not checked. [2025-03-08 02:07:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573649357] [2025-03-08 02:07:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573649357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124923590] [2025-03-08 02:07:46,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:46,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:46,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:46,508 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:07:46,510 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:07:46,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1995 statements into 1 equivalence classes. [2025-03-08 02:07:46,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1995 of 1995 statements. [2025-03-08 02:07:46,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:46,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:46,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 2309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:46,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 8115 backedges. 4815 proven. 0 refuted. 0 times theorem prover too weak. 3300 trivial. 0 not checked. [2025-03-08 02:07:47,087 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:47,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124923590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:47,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:47,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:07:47,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939448854] [2025-03-08 02:07:47,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:47,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:47,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:47,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:47,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:47,089 INFO L87 Difference]: Start difference. First operand 18428 states and 18804 transitions. Second operand has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:47,682 INFO L93 Difference]: Finished difference Result 38499 states and 39299 transitions. [2025-03-08 02:07:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 1995 [2025-03-08 02:07:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:47,700 INFO L225 Difference]: With dead ends: 38499 [2025-03-08 02:07:47,700 INFO L226 Difference]: Without dead ends: 20731 [2025-03-08 02:07:47,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2000 GetRequests, 1995 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:47,712 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:47,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 425 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:47,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20731 states. [2025-03-08 02:07:47,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20731 to 19744. [2025-03-08 02:07:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0200070911209036) internal successors, (20138), 19743 states have internal predecessors, (20138), 0 states have call successors, (0), 0 states 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:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20138 transitions. [2025-03-08 02:07:47,862 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20138 transitions. Word has length 1995 [2025-03-08 02:07:47,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:47,862 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20138 transitions. [2025-03-08 02:07:47,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20138 transitions. [2025-03-08 02:07:47,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2027 [2025-03-08 02:07:47,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:47,884 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 02:07:48,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:48,085 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:48,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:48,086 INFO L85 PathProgramCache]: Analyzing trace with hash -964528200, now seen corresponding path program 1 times [2025-03-08 02:07:48,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:48,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639688620] [2025-03-08 02:07:48,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:48,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:48,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2026 statements into 1 equivalence classes. [2025-03-08 02:07:48,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2026 of 2026 statements. [2025-03-08 02:07:48,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 6299 proven. 91 refuted. 0 times theorem prover too weak. 2085 trivial. 0 not checked. [2025-03-08 02:07:50,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639688620] [2025-03-08 02:07:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639688620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:50,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502398157] [2025-03-08 02:07:50,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:50,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:50,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:50,036 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:07:50,037 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:07:50,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2026 statements into 1 equivalence classes. [2025-03-08 02:07:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2026 of 2026 statements. [2025-03-08 02:07:50,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:50,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:50,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 2343 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:07:50,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 5407 proven. 67 refuted. 0 times theorem prover too weak. 3001 trivial. 0 not checked. [2025-03-08 02:07:54,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 4399 proven. 0 refuted. 0 times theorem prover too weak. 4076 trivial. 0 not checked. [2025-03-08 02:07:56,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502398157] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:56,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-03-08 02:07:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128821562] [2025-03-08 02:07:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:56,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:56,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:56,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:56,940 INFO L87 Difference]: Start difference. First operand 19744 states and 20138 transitions. Second operand has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:57,607 INFO L93 Difference]: Finished difference Result 39486 states and 40281 transitions. [2025-03-08 02:07:57,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:57,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 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 2026 [2025-03-08 02:07:57,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:57,625 INFO L225 Difference]: With dead ends: 39486 [2025-03-08 02:07:57,625 INFO L226 Difference]: Without dead ends: 20402 [2025-03-08 02:07:57,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4056 GetRequests, 4049 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:57,635 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:57,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 40 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:57,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-08 02:07:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 19744. [2025-03-08 02:07:57,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0190447247125562) internal successors, (20119), 19743 states have internal predecessors, (20119), 0 states have call successors, (0), 0 states 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,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20119 transitions. [2025-03-08 02:07:57,786 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20119 transitions. Word has length 2026 [2025-03-08 02:07:57,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:57,787 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20119 transitions. [2025-03-08 02:07:57,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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,787 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20119 transitions. [2025-03-08 02:07:57,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2025-03-08 02:07:57,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:57,811 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,819 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:07:58,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:58,011 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 170099720, now seen corresponding path program 1 times [2025-03-08 02:07:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34000409] [2025-03-08 02:07:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:58,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2076 statements into 1 equivalence classes. [2025-03-08 02:07:58,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2076 of 2076 statements. [2025-03-08 02:07:58,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:58,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8867 backedges. 5723 proven. 79 refuted. 0 times theorem prover too weak. 3065 trivial. 0 not checked. [2025-03-08 02:08:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34000409] [2025-03-08 02:08:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34000409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:00,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127941713] [2025-03-08 02:08:00,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:00,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:00,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:00,360 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:00,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:08:00,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2076 statements into 1 equivalence classes. [2025-03-08 02:08:00,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2076 of 2076 statements. [2025-03-08 02:08:00,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:00,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:00,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 2395 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 02:08:00,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8867 backedges. 5274 proven. 250 refuted. 0 times theorem prover too weak. 3343 trivial. 0 not checked. [2025-03-08 02:08:01,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:08:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8867 backedges. 4343 proven. 0 refuted. 0 times theorem prover too weak. 4524 trivial. 0 not checked. [2025-03-08 02:08:02,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127941713] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:02,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:08:02,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-08 02:08:02,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109712105] [2025-03-08 02:08:02,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:02,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:02,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:02,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:08:02,308 INFO L87 Difference]: Start difference. First operand 19744 states and 20119 transitions. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:02,937 INFO L93 Difference]: Finished difference Result 39486 states and 40238 transitions. [2025-03-08 02:08:02,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:02,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2076 [2025-03-08 02:08:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:02,950 INFO L225 Difference]: With dead ends: 39486 [2025-03-08 02:08:02,950 INFO L226 Difference]: Without dead ends: 20073 [2025-03-08 02:08:02,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4154 GetRequests, 4149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:08:02,959 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 85 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:02,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 17 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:08:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-08 02:08:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 19744. [2025-03-08 02:08:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0188927721217647) internal successors, (20116), 19743 states have internal predecessors, (20116), 0 states have call successors, (0), 0 states 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:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20116 transitions. [2025-03-08 02:08:03,094 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20116 transitions. Word has length 2076 [2025-03-08 02:08:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:03,095 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20116 transitions. [2025-03-08 02:08:03,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:08:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20116 transitions. [2025-03-08 02:08:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2144 [2025-03-08 02:08:03,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:03,119 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:08:03,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 02:08:03,320 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:03,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:03,320 INFO L85 PathProgramCache]: Analyzing trace with hash -40104971, now seen corresponding path program 1 times [2025-03-08 02:08:03,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:03,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877172174] [2025-03-08 02:08:03,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:03,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:03,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2143 statements into 1 equivalence classes. [2025-03-08 02:08:03,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2143 of 2143 statements. [2025-03-08 02:08:03,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:03,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:05,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9693 backedges. 6124 proven. 79 refuted. 0 times theorem prover too weak. 3490 trivial. 0 not checked. [2025-03-08 02:08:05,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877172174] [2025-03-08 02:08:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877172174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556340659] [2025-03-08 02:08:05,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:05,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:05,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:05,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:05,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:08:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2143 statements into 1 equivalence classes. [2025-03-08 02:08:06,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2143 of 2143 statements. [2025-03-08 02:08:06,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:06,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:06,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 2482 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:08:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9693 backedges. 5764 proven. 0 refuted. 0 times theorem prover too weak. 3929 trivial. 0 not checked. [2025-03-08 02:08:06,929 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:08:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556340659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:06,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:08:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 02:08:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262655664] [2025-03-08 02:08:06,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:06,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:06,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:08:06,931 INFO L87 Difference]: Start difference. First operand 19744 states and 20116 transitions. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:08:07,521 INFO L93 Difference]: Finished difference Result 39815 states and 40566 transitions. [2025-03-08 02:08:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:08:07,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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 2143 [2025-03-08 02:08:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:08:07,543 INFO L225 Difference]: With dead ends: 39815 [2025-03-08 02:08:07,543 INFO L226 Difference]: Without dead ends: 20402 [2025-03-08 02:08:07,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2146 GetRequests, 2143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:08:07,557 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 52 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:08:07,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 90 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:08:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-08 02:08:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 19744. [2025-03-08 02:08:07,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0187914703945702) internal successors, (20114), 19743 states have internal predecessors, (20114), 0 states have call successors, (0), 0 states 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,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20114 transitions. [2025-03-08 02:08:07,725 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20114 transitions. Word has length 2143 [2025-03-08 02:08:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:08:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20114 transitions. [2025-03-08 02:08:07,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20114 transitions. [2025-03-08 02:08:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2169 [2025-03-08 02:08:07,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:08:07,753 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:08:07,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 02:08:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 02:08:07,953 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:08:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:08:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash -115814475, now seen corresponding path program 1 times [2025-03-08 02:08:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:08:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068766263] [2025-03-08 02:08:07,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:07,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:08:08,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2168 statements into 1 equivalence classes. [2025-03-08 02:08:08,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2168 of 2168 statements. [2025-03-08 02:08:08,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:08,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:12,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9525 backedges. 7091 proven. 655 refuted. 0 times theorem prover too weak. 1779 trivial. 0 not checked. [2025-03-08 02:08:12,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:08:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068766263] [2025-03-08 02:08:12,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068766263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:08:12,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129264277] [2025-03-08 02:08:12,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:08:12,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:08:12,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:08:12,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:08:12,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 02:08:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2168 statements into 1 equivalence classes. [2025-03-08 02:08:12,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2168 of 2168 statements. [2025-03-08 02:08:12,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:08:12,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:08:12,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:08:12,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:08:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9525 backedges. 5449 proven. 0 refuted. 0 times theorem prover too weak. 4076 trivial. 0 not checked. [2025-03-08 02:08:12,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:08:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129264277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:08:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:08:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 02:08:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411505636] [2025-03-08 02:08:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:08:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:08:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:08:12,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:08:12,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:08:12,579 INFO L87 Difference]: Start difference. First operand 19744 states and 20114 transitions. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)