./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label27.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/Problem19_label27.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 6ab24122cfbae27f78ca86ca1d1162f9de3aff1954d8424bcfc24fa3959df5e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:21:21,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:21:21,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:21:21,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:21:21,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:21:21,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:21:21,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:21:21,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:21:21,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:21:21,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:21:21,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:21:21,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:21:21,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:21:21,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:21:21,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:21:21,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:21:21,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:21:21,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:21:21,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:21,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:21:21,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:21:21,665 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 -> 6ab24122cfbae27f78ca86ca1d1162f9de3aff1954d8424bcfc24fa3959df5e7 [2025-03-08 02:21:21,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:21:21,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:21:21,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:21:21,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:21:21,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:21:21,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label27.c [2025-03-08 02:21:23,031 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da955c332/cf1892b7dccb41d8939270a7ffb44f65/FLAGf13546da4 [2025-03-08 02:21:23,494 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:21:23,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label27.c [2025-03-08 02:21:23,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da955c332/cf1892b7dccb41d8939270a7ffb44f65/FLAGf13546da4 [2025-03-08 02:21:23,602 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da955c332/cf1892b7dccb41d8939270a7ffb44f65 [2025-03-08 02:21:23,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:21:23,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:21:23,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:23,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:21:23,608 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:21:23,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:23" (1/1) ... [2025-03-08 02:21:23,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c095b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:23, skipping insertion in model container [2025-03-08 02:21:23,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:21:23" (1/1) ... [2025-03-08 02:21:23,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:21:23,935 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/Problem19_label27.c[3867,3880] [2025-03-08 02:21:24,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:24,647 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:21:24,661 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/Problem19_label27.c[3867,3880] [2025-03-08 02:21:25,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:21:25,157 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:21:25,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25 WrapperNode [2025-03-08 02:21:25,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:21:25,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:25,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:21:25,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:21:25,164 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:21:25" (1/1) ... [2025-03-08 02:21:25,218 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:21:25" (1/1) ... [2025-03-08 02:21:25,681 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-08 02:21:25,681 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:21:25,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:21:25,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:21:25,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:21:25,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:25,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:25,838 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,118 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:21:26,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:21:26,533 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:21:26,533 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:21:26,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:21:26,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (1/1) ... [2025-03-08 02:21:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:21:26,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:21:26,560 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:21:26,563 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:21:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:21:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:21:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:21:26,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:21:26,639 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:21:26,640 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:21:32,435 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-08 02:21:32,436 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-08 02:21:32,436 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-08 02:21:32,437 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-08 02:21:32,437 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-08 02:21:32,642 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-08 02:21:32,643 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:21:32,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:21:32,688 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:21:32,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:21:32 BoogieIcfgContainer [2025-03-08 02:21:32,688 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:21:32,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:21:32,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:21:32,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:21:32,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:21:23" (1/3) ... [2025-03-08 02:21:32,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1581ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:21:32, skipping insertion in model container [2025-03-08 02:21:32,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:21:25" (2/3) ... [2025-03-08 02:21:32,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1581ff4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:21:32, skipping insertion in model container [2025-03-08 02:21:32,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:21:32" (3/3) ... [2025-03-08 02:21:32,696 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label27.c [2025-03-08 02:21:32,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:21:32,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label27.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:21:32,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:21:32,799 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;@579a1c2b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:21:32,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:21:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states 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:21:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 02:21:32,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:32,812 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:32,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1899283105, now seen corresponding path program 1 times [2025-03-08 02:21:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298306046] [2025-03-08 02:21:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:32,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 02:21:32,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 02:21:32,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:32,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:33,037 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:21:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298306046] [2025-03-08 02:21:33,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298306046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:33,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:33,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:21:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404789612] [2025-03-08 02:21:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:33,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:33,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:33,061 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:21:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:38,506 INFO L93 Difference]: Finished difference Result 4957 states and 9395 transitions. [2025-03-08 02:21:38,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:21:38,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-03-08 02:21:38,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:38,530 INFO L225 Difference]: With dead ends: 4957 [2025-03-08 02:21:38,530 INFO L226 Difference]: Without dead ends: 3129 [2025-03-08 02:21:38,536 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:21:38,538 INFO L435 NwaCegarLoop]: 1376 mSDtfsCounter, 1599 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1599 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:38,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1599 Valid, 1598 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-03-08 02:21:38,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-03-08 02:21:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2025-03-08 02:21:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 states 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:21:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2025-03-08 02:21:38,650 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 27 [2025-03-08 02:21:38,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:38,650 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2025-03-08 02:21:38,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states 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:21:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2025-03-08 02:21:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 02:21:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:38,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:38,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:21:38,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:38,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:38,655 INFO L85 PathProgramCache]: Analyzing trace with hash -197902369, now seen corresponding path program 1 times [2025-03-08 02:21:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376621643] [2025-03-08 02:21:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:38,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 02:21:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 02:21:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:39,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:39,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376621643] [2025-03-08 02:21:39,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376621643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:39,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:39,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624721788] [2025-03-08 02:21:39,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:39,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:39,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:39,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:39,054 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:21:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:45,842 INFO L93 Difference]: Finished difference Result 10359 states and 16187 transitions. [2025-03-08 02:21:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-08 02:21:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:45,863 INFO L225 Difference]: With dead ends: 10359 [2025-03-08 02:21:45,863 INFO L226 Difference]: Without dead ends: 7253 [2025-03-08 02:21:45,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:21:45,868 INFO L435 NwaCegarLoop]: 1026 mSDtfsCounter, 4323 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4323 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:45,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4323 Valid, 1296 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-08 02:21:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-03-08 02:21:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249. [2025-03-08 02:21:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7248 states have (on average 1.4503311258278146) internal successors, (10512), 7248 states have internal predecessors, (10512), 0 states have call successors, (0), 0 states 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:21:46,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10512 transitions. [2025-03-08 02:21:46,056 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10512 transitions. Word has length 94 [2025-03-08 02:21:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:46,057 INFO L471 AbstractCegarLoop]: Abstraction has 7249 states and 10512 transitions. [2025-03-08 02:21:46,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states 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:21:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10512 transitions. [2025-03-08 02:21:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-03-08 02:21:46,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:46,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:46,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:21:46,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:46,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:46,066 INFO L85 PathProgramCache]: Analyzing trace with hash 203772181, now seen corresponding path program 1 times [2025-03-08 02:21:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871463404] [2025-03-08 02:21:46,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-03-08 02:21:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-03-08 02:21:46,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:46,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 02:21:46,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871463404] [2025-03-08 02:21:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871463404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15000424] [2025-03-08 02:21:46,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:46,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:46,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:46,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:46,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:46,960 INFO L87 Difference]: Start difference. First operand 7249 states and 10512 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:21:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:53,401 INFO L93 Difference]: Finished difference Result 17269 states and 24867 transitions. [2025-03-08 02:21:53,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:53,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 301 [2025-03-08 02:21:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:53,429 INFO L225 Difference]: With dead ends: 17269 [2025-03-08 02:21:53,429 INFO L226 Difference]: Without dead ends: 11387 [2025-03-08 02:21:53,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:21:53,435 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:53,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2025-03-08 02:21:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-03-08 02:21:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367. [2025-03-08 02:21:53,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.3286116487770543) internal successors, (15101), 11366 states have internal predecessors, (15101), 0 states have call successors, (0), 0 states 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:21:53,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15101 transitions. [2025-03-08 02:21:53,575 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15101 transitions. Word has length 301 [2025-03-08 02:21:53,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:53,576 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15101 transitions. [2025-03-08 02:21:53,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states 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:21:53,576 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15101 transitions. [2025-03-08 02:21:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 02:21:53,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:53,578 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:21:53,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:21:53,579 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:53,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:53,579 INFO L85 PathProgramCache]: Analyzing trace with hash 723713959, now seen corresponding path program 1 times [2025-03-08 02:21:53,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:53,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041704972] [2025-03-08 02:21:53,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:53,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:53,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 02:21:53,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 02:21:53,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:53,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:54,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:54,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041704972] [2025-03-08 02:21:54,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041704972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:54,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:54,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:54,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280449872] [2025-03-08 02:21:54,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:54,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:21:54,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:54,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:21:54,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:21:54,363 INFO L87 Difference]: Start difference. First operand 11367 states and 15101 transitions. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:21:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:21:59,053 INFO L93 Difference]: Finished difference Result 20033 states and 27483 transitions. [2025-03-08 02:21:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:21:59,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 329 [2025-03-08 02:21:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:21:59,077 INFO L225 Difference]: With dead ends: 20033 [2025-03-08 02:21:59,078 INFO L226 Difference]: Without dead ends: 11367 [2025-03-08 02:21:59,088 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:21:59,090 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:21:59,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 02:21:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2025-03-08 02:21:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367. [2025-03-08 02:21:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.3274678866795706) internal successors, (15088), 11366 states have internal predecessors, (15088), 0 states have call successors, (0), 0 states 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:21:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15088 transitions. [2025-03-08 02:21:59,259 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15088 transitions. Word has length 329 [2025-03-08 02:21:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:21:59,260 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15088 transitions. [2025-03-08 02:21:59,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states 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:21:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15088 transitions. [2025-03-08 02:21:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-03-08 02:21:59,269 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:21:59,269 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:59,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:21:59,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:21:59,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:21:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 50114090, now seen corresponding path program 1 times [2025-03-08 02:21:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:21:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394272237] [2025-03-08 02:21:59,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:21:59,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:21:59,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-03-08 02:21:59,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-03-08 02:21:59,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:21:59,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:21:59,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:21:59,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:21:59,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394272237] [2025-03-08 02:21:59,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394272237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:21:59,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:21:59,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:21:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096363112] [2025-03-08 02:21:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:21:59,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:21:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:21:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:21:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:21:59,697 INFO L87 Difference]: Start difference. First operand 11367 states and 15088 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:22:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:04,063 INFO L93 Difference]: Finished difference Result 25557 states and 36131 transitions. [2025-03-08 02:22:04,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:04,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 514 [2025-03-08 02:22:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:04,094 INFO L225 Difference]: With dead ends: 25557 [2025-03-08 02:22:04,094 INFO L226 Difference]: Without dead ends: 16922 [2025-03-08 02:22:04,102 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:22:04,104 INFO L435 NwaCegarLoop]: 2753 mSDtfsCounter, 1494 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4068 mSolverCounterSat, 1816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 2930 SdHoareTripleChecker+Invalid, 5884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1816 IncrementalHoareTripleChecker+Valid, 4068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:04,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 2930 Invalid, 5884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1816 Valid, 4068 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:22:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16922 states. [2025-03-08 02:22:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16922 to 16876. [2025-03-08 02:22:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16876 states, 16875 states have (on average 1.2959407407407408) internal successors, (21869), 16875 states have internal predecessors, (21869), 0 states have call successors, (0), 0 states 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:22:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16876 states to 16876 states and 21869 transitions. [2025-03-08 02:22:04,268 INFO L78 Accepts]: Start accepts. Automaton has 16876 states and 21869 transitions. Word has length 514 [2025-03-08 02:22:04,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:04,268 INFO L471 AbstractCegarLoop]: Abstraction has 16876 states and 21869 transitions. [2025-03-08 02:22:04,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:22:04,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16876 states and 21869 transitions. [2025-03-08 02:22:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2025-03-08 02:22:04,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:04,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:04,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:22:04,279 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:04,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:04,280 INFO L85 PathProgramCache]: Analyzing trace with hash -658913675, now seen corresponding path program 1 times [2025-03-08 02:22:04,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:04,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368028274] [2025-03-08 02:22:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:04,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:04,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 583 statements into 1 equivalence classes. [2025-03-08 02:22:04,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 583 of 583 statements. [2025-03-08 02:22:04,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:04,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 02:22:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368028274] [2025-03-08 02:22:04,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368028274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:04,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:04,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:22:04,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336716741] [2025-03-08 02:22:04,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:04,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:04,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:04,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:04,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:04,660 INFO L87 Difference]: Start difference. First operand 16876 states and 21869 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:22:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:09,517 INFO L93 Difference]: Finished difference Result 44874 states and 59739 transitions. [2025-03-08 02:22:09,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:09,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 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 583 [2025-03-08 02:22:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:09,549 INFO L225 Difference]: With dead ends: 44874 [2025-03-08 02:22:09,549 INFO L226 Difference]: Without dead ends: 30730 [2025-03-08 02:22:09,558 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:22:09,558 INFO L435 NwaCegarLoop]: 720 mSDtfsCounter, 2113 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2113 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 5554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:09,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2113 Valid, 991 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:22:09,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30730 states. [2025-03-08 02:22:09,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30730 to 30726. [2025-03-08 02:22:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30726 states, 30725 states have (on average 1.2913262815296989) internal successors, (39676), 30725 states have internal predecessors, (39676), 0 states have call successors, (0), 0 states 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:22:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30726 states to 30726 states and 39676 transitions. [2025-03-08 02:22:09,825 INFO L78 Accepts]: Start accepts. Automaton has 30726 states and 39676 transitions. Word has length 583 [2025-03-08 02:22:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:09,825 INFO L471 AbstractCegarLoop]: Abstraction has 30726 states and 39676 transitions. [2025-03-08 02:22:09,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:22:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 30726 states and 39676 transitions. [2025-03-08 02:22:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 637 [2025-03-08 02:22:09,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:09,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:09,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:22:09,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:09,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -577400758, now seen corresponding path program 1 times [2025-03-08 02:22:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843101274] [2025-03-08 02:22:09,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:09,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-03-08 02:22:09,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-03-08 02:22:09,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:09,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 49 proven. 40 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 02:22:10,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843101274] [2025-03-08 02:22:10,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843101274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:22:10,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670365916] [2025-03-08 02:22:10,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:22:10,719 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:22:10,720 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:22:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes. [2025-03-08 02:22:10,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements. [2025-03-08 02:22:10,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:10,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:10,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:22:10,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:22:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:22:11,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:22:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670365916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:22:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:22:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862020182] [2025-03-08 02:22:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:11,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:11,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:22:11,122 INFO L87 Difference]: Start difference. First operand 30726 states and 39676 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:22:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:15,572 INFO L93 Difference]: Finished difference Result 81928 states and 107619 transitions. [2025-03-08 02:22:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:15,573 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 636 [2025-03-08 02:22:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:15,630 INFO L225 Difference]: With dead ends: 81928 [2025-03-08 02:22:15,630 INFO L226 Difference]: Without dead ends: 53934 [2025-03-08 02:22:15,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:22:15,650 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1548 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 3912 mSolverCounterSat, 1728 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 5640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1728 IncrementalHoareTripleChecker+Valid, 3912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:15,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1680 Invalid, 5640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1728 Valid, 3912 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 02:22:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53934 states. [2025-03-08 02:22:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53934 to 48472. [2025-03-08 02:22:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48472 states, 48471 states have (on average 1.2145612840667617) internal successors, (58871), 48471 states have internal predecessors, (58871), 0 states have call successors, (0), 0 states 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:22:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48472 states to 48472 states and 58871 transitions. [2025-03-08 02:22:16,102 INFO L78 Accepts]: Start accepts. Automaton has 48472 states and 58871 transitions. Word has length 636 [2025-03-08 02:22:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:16,103 INFO L471 AbstractCegarLoop]: Abstraction has 48472 states and 58871 transitions. [2025-03-08 02:22:16,103 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:22:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 48472 states and 58871 transitions. [2025-03-08 02:22:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2025-03-08 02:22:16,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:16,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:16,116 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:22:16,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:16,311 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:16,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash -486767048, now seen corresponding path program 1 times [2025-03-08 02:22:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064442221] [2025-03-08 02:22:16,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:16,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 726 statements into 1 equivalence classes. [2025-03-08 02:22:16,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 726 of 726 statements. [2025-03-08 02:22:16,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:16,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-08 02:22:16,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:16,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064442221] [2025-03-08 02:22:16,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064442221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417935555] [2025-03-08 02:22:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:16,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:16,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:16,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:16,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:16,692 INFO L87 Difference]: Start difference. First operand 48472 states and 58871 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:22:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:21,731 INFO L93 Difference]: Finished difference Result 118887 states and 147123 transitions. [2025-03-08 02:22:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 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 726 [2025-03-08 02:22:21,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:21,803 INFO L225 Difference]: With dead ends: 118887 [2025-03-08 02:22:21,804 INFO L226 Difference]: Without dead ends: 73147 [2025-03-08 02:22:21,834 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:22:21,835 INFO L435 NwaCegarLoop]: 3164 mSDtfsCounter, 1446 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 5071 mSolverCounterSat, 965 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 3338 SdHoareTripleChecker+Invalid, 6036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 965 IncrementalHoareTripleChecker+Valid, 5071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:21,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 3338 Invalid, 6036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [965 Valid, 5071 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-08 02:22:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73147 states. [2025-03-08 02:22:22,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73147 to 73084. [2025-03-08 02:22:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73084 states, 73083 states have (on average 1.1800418702023727) internal successors, (86241), 73083 states have internal predecessors, (86241), 0 states have call successors, (0), 0 states 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:22:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73084 states to 73084 states and 86241 transitions. [2025-03-08 02:22:22,491 INFO L78 Accepts]: Start accepts. Automaton has 73084 states and 86241 transitions. Word has length 726 [2025-03-08 02:22:22,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:22,491 INFO L471 AbstractCegarLoop]: Abstraction has 73084 states and 86241 transitions. [2025-03-08 02:22:22,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states 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:22:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 73084 states and 86241 transitions. [2025-03-08 02:22:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-08 02:22:22,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:22,496 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:22,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:22:22,496 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:22,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1502355066, now seen corresponding path program 1 times [2025-03-08 02:22:22,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:22,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645405889] [2025-03-08 02:22:22,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:22,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:22,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 02:22:22,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 02:22:22,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:22,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-08 02:22:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645405889] [2025-03-08 02:22:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645405889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:22:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996170958] [2025-03-08 02:22:23,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:23,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:22:23,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:22:23,509 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:22:23,517 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:22:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-08 02:22:23,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-08 02:22:23,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:23,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:23,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:22:23,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:22:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 02:22:23,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:22:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996170958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:23,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:22:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-08 02:22:23,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190149826] [2025-03-08 02:22:23,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:23,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:23,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:23,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:23,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:22:23,899 INFO L87 Difference]: Start difference. First operand 73084 states and 86241 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:22:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:28,803 INFO L93 Difference]: Finished difference Result 170850 states and 204743 transitions. [2025-03-08 02:22:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:28,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 733 [2025-03-08 02:22:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:28,928 INFO L225 Difference]: With dead ends: 170850 [2025-03-08 02:22:28,929 INFO L226 Difference]: Without dead ends: 100498 [2025-03-08 02:22:28,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 732 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:22:28,959 INFO L435 NwaCegarLoop]: 3094 mSDtfsCounter, 1454 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 993 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1454 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 6001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 993 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:28,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1454 Valid, 3266 Invalid, 6001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [993 Valid, 5008 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 02:22:29,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100498 states. [2025-03-08 02:22:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100498 to 99032. [2025-03-08 02:22:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99032 states, 99031 states have (on average 1.1638577819066758) internal successors, (115258), 99031 states have internal predecessors, (115258), 0 states have call successors, (0), 0 states 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:22:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99032 states to 99032 states and 115258 transitions. [2025-03-08 02:22:29,850 INFO L78 Accepts]: Start accepts. Automaton has 99032 states and 115258 transitions. Word has length 733 [2025-03-08 02:22:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:29,851 INFO L471 AbstractCegarLoop]: Abstraction has 99032 states and 115258 transitions. [2025-03-08 02:22:29,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:22:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 99032 states and 115258 transitions. [2025-03-08 02:22:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-08 02:22:29,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:29,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:29,863 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:22:30,057 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,SelfDestructingSolverStorable8 [2025-03-08 02:22:30,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:30,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:30,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1005002281, now seen corresponding path program 1 times [2025-03-08 02:22:30,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:30,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090145133] [2025-03-08 02:22:30,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:30,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:30,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes. [2025-03-08 02:22:30,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 820 of 820 statements. [2025-03-08 02:22:30,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:30,439 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-08 02:22:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090145133] [2025-03-08 02:22:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090145133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:22:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993119862] [2025-03-08 02:22:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:22:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:30,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:22:30,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:22:30,445 INFO L87 Difference]: Start difference. First operand 99032 states and 115258 transitions. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:22:35,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:35,594 INFO L93 Difference]: Finished difference Result 228129 states and 270808 transitions. [2025-03-08 02:22:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:22:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 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 820 [2025-03-08 02:22:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:35,725 INFO L225 Difference]: With dead ends: 228129 [2025-03-08 02:22:35,725 INFO L226 Difference]: Without dead ends: 131829 [2025-03-08 02:22:35,750 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:22:35,750 INFO L435 NwaCegarLoop]: 1444 mSDtfsCounter, 1546 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4016 mSolverCounterSat, 1701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1546 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 5717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1701 IncrementalHoareTripleChecker+Valid, 4016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:35,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1546 Valid, 1635 Invalid, 5717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1701 Valid, 4016 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-08 02:22:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131829 states. [2025-03-08 02:22:36,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131829 to 100334. [2025-03-08 02:22:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100334 states, 100333 states have (on average 1.1615819321658876) internal successors, (116545), 100333 states have internal predecessors, (116545), 0 states have call successors, (0), 0 states 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:22:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100334 states to 100334 states and 116545 transitions. [2025-03-08 02:22:36,815 INFO L78 Accepts]: Start accepts. Automaton has 100334 states and 116545 transitions. Word has length 820 [2025-03-08 02:22:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:22:36,816 INFO L471 AbstractCegarLoop]: Abstraction has 100334 states and 116545 transitions. [2025-03-08 02:22:36,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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:22:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 100334 states and 116545 transitions. [2025-03-08 02:22:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 888 [2025-03-08 02:22:36,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:22:36,843 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:36,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:22:36,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:22:36,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:22:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2009653578, now seen corresponding path program 1 times [2025-03-08 02:22:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:22:36,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526689306] [2025-03-08 02:22:36,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:22:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:22:36,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 887 statements into 1 equivalence classes. [2025-03-08 02:22:37,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 887 of 887 statements. [2025-03-08 02:22:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:22:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:22:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 689 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-08 02:22:37,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:22:37,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526689306] [2025-03-08 02:22:37,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526689306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:22:37,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:22:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:22:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075916619] [2025-03-08 02:22:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:22:37,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:22:37,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:22:37,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:22:37,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:22:37,491 INFO L87 Difference]: Start difference. First operand 100334 states and 116545 transitions. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:22:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:22:44,978 INFO L93 Difference]: Finished difference Result 282596 states and 335933 transitions. [2025-03-08 02:22:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:22:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 887 [2025-03-08 02:22:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:22:45,190 INFO L225 Difference]: With dead ends: 282596 [2025-03-08 02:22:45,190 INFO L226 Difference]: Without dead ends: 184994 [2025-03-08 02:22:45,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:22:45,242 INFO L435 NwaCegarLoop]: 2655 mSDtfsCounter, 2837 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 10260 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2837 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 11627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 10260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:22:45,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2837 Valid, 3132 Invalid, 11627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 10260 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-03-08 02:22:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184994 states.