./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label25.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label25.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 2828fcd63ce72084c4fe1d4b095824858b5148399c7a2397e97473c901021226 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:29:52,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:29:52,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:29:52,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:29:52,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:29:52,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:29:52,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:29:52,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:29:52,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:29:52,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:29:52,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:29:52,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:29:52,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:29:52,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:29:52,224 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:29:52,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:29:52,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:29:52,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:29:52,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:29:52,226 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:29:52,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:29:52,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:29:52,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:29:52,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:29:52,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:29:52,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:29:52,227 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 -> 2828fcd63ce72084c4fe1d4b095824858b5148399c7a2397e97473c901021226 [2025-03-16 15:29:52,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:29:52,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:29:52,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:29:52,469 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:29:52,469 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:29:52,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label25.c [2025-03-16 15:29:53,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3904b467e/483f780292dd459e908bde4b4269161a/FLAGc02dff67a [2025-03-16 15:29:54,113 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:29:54,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label25.c [2025-03-16 15:29:54,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3904b467e/483f780292dd459e908bde4b4269161a/FLAGc02dff67a [2025-03-16 15:29:54,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3904b467e/483f780292dd459e908bde4b4269161a [2025-03-16 15:29:54,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:29:54,171 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:29:54,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:29:54,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:29:54,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:29:54,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:29:54" (1/1) ... [2025-03-16 15:29:54,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@be1230b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:54, skipping insertion in model container [2025-03-16 15:29:54,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:29:54" (1/1) ... [2025-03-16 15:29:54,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:29:54,492 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_label25.c[4945,4958] [2025-03-16 15:29:55,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:29:55,169 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:29:55,183 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_label25.c[4945,4958] [2025-03-16 15:29:55,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:29:55,637 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:29:55,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55 WrapperNode [2025-03-16 15:29:55,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:29:55,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:29:55,640 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:29:55,640 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:29:55,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:55,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,203 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:29:56,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:29:56,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:29:56,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:29:56,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:29:56,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,356 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 15:29:56,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:56,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:57,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:29:57,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:29:57,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:29:57,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:29:57,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (1/1) ... [2025-03-16 15:29:57,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:29:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:29:57,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 15:29:57,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 15:29:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:29:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:29:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:29:57,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:29:57,113 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:29:57,115 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:30:02,653 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:30:02,654 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:30:02,654 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:30:02,654 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:30:02,655 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:30:02,876 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:30:02,876 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:30:02,915 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:30:02,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:30:02,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:30:02 BoogieIcfgContainer [2025-03-16 15:30:02,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:30:02,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:30:02,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:30:02,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:30:02,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:29:54" (1/3) ... [2025-03-16 15:30:02,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40383127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:30:02, skipping insertion in model container [2025-03-16 15:30:02,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:55" (2/3) ... [2025-03-16 15:30:02,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40383127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:30:02, skipping insertion in model container [2025-03-16 15:30:02,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:30:02" (3/3) ... [2025-03-16 15:30:02,928 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label25.c [2025-03-16 15:30:02,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:30:02,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label25.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:30:03,014 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:30:03,023 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;@2c11d272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:30:03,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:30:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:03,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 15:30:03,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:03,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:03,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:03,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:03,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1810439242, now seen corresponding path program 1 times [2025-03-16 15:30:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:03,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023437495] [2025-03-16 15:30:03,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:03,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 15:30:03,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 15:30:03,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:03,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:03,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:03,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023437495] [2025-03-16 15:30:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023437495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:03,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:03,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:03,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316219406] [2025-03-16 15:30:03,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:03,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:30:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:03,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:30:03,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:30:03,186 INFO L87 Difference]: Start difference. First operand has 1687 states, 1685 states have (on average 1.9008902077151335) internal successors, (3203), 1686 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:03,294 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:30:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:30:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 15:30:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:03,318 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:30:03,319 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:30:03,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:30:03,330 INFO L435 NwaCegarLoop]: 3141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:03,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:30:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:30:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:30:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1683 states have (on average 1.8645276292335116) internal successors, (3138), 1683 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:30:03,417 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 35 [2025-03-16 15:30:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:03,418 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:30:03,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:30:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 15:30:03,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:03,419 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:03,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:30:03,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:03,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1451318826, now seen corresponding path program 1 times [2025-03-16 15:30:03,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:03,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316840604] [2025-03-16 15:30:03,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:03,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 15:30:03,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 15:30:03,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:03,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316840604] [2025-03-16 15:30:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316840604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729049759] [2025-03-16 15:30:03,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:03,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:03,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:03,565 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:08,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:08,552 INFO L93 Difference]: Finished difference Result 4789 states and 8995 transitions. [2025-03-16 15:30:08,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:08,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 15:30:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:08,563 INFO L225 Difference]: With dead ends: 4789 [2025-03-16 15:30:08,564 INFO L226 Difference]: Without dead ends: 3106 [2025-03-16 15:30:08,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:08,567 INFO L435 NwaCegarLoop]: 1214 mSDtfsCounter, 1513 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4578 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 5628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 4578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:08,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1392 Invalid, 5628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 4578 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-16 15:30:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2025-03-16 15:30:08,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3105. [2025-03-16 15:30:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 3104 states have (on average 1.653028350515464) internal successors, (5131), 3104 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5131 transitions. [2025-03-16 15:30:08,659 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5131 transitions. Word has length 35 [2025-03-16 15:30:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:08,659 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5131 transitions. [2025-03-16 15:30:08,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5131 transitions. [2025-03-16 15:30:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 15:30:08,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:08,662 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:08,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:30:08,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:08,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:08,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1455309116, now seen corresponding path program 1 times [2025-03-16 15:30:08,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:08,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568942361] [2025-03-16 15:30:08,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:08,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:08,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 15:30:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 15:30:08,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:08,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:08,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:08,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568942361] [2025-03-16 15:30:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568942361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:08,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203404112] [2025-03-16 15:30:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:08,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:08,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:08,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:08,853 INFO L87 Difference]: Start difference. First operand 3105 states and 5131 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:13,484 INFO L93 Difference]: Finished difference Result 9096 states and 15083 transitions. [2025-03-16 15:30:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 15:30:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:13,503 INFO L225 Difference]: With dead ends: 9096 [2025-03-16 15:30:13,503 INFO L226 Difference]: Without dead ends: 5992 [2025-03-16 15:30:13,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:13,508 INFO L435 NwaCegarLoop]: 719 mSDtfsCounter, 2533 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5120 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2533 SdHoareTripleChecker+Valid, 989 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.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:13,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2533 Valid, 989 Invalid, 5554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5120 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:30:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5992 states. [2025-03-16 15:30:13,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5992 to 5990. [2025-03-16 15:30:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5990 states, 5989 states have (on average 1.606278176657205) internal successors, (9620), 5989 states have internal predecessors, (9620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5990 states to 5990 states and 9620 transitions. [2025-03-16 15:30:13,603 INFO L78 Accepts]: Start accepts. Automaton has 5990 states and 9620 transitions. Word has length 104 [2025-03-16 15:30:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:13,604 INFO L471 AbstractCegarLoop]: Abstraction has 5990 states and 9620 transitions. [2025-03-16 15:30:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5990 states and 9620 transitions. [2025-03-16 15:30:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 15:30:13,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:13,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:13,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:30:13,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:13,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:13,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1447916334, now seen corresponding path program 1 times [2025-03-16 15:30:13,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675067204] [2025-03-16 15:30:13,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:13,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:13,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 15:30:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 15:30:13,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:13,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675067204] [2025-03-16 15:30:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675067204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:13,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326655361] [2025-03-16 15:30:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:13,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:13,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:13,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:13,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:13,772 INFO L87 Difference]: Start difference. First operand 5990 states and 9620 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:18,229 INFO L93 Difference]: Finished difference Result 17558 states and 28307 transitions. [2025-03-16 15:30:18,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:18,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2025-03-16 15:30:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:18,256 INFO L225 Difference]: With dead ends: 17558 [2025-03-16 15:30:18,256 INFO L226 Difference]: Without dead ends: 11569 [2025-03-16 15:30:18,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:18,263 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1446 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 4825 mSolverCounterSat, 1045 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 5870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1045 IncrementalHoareTripleChecker+Valid, 4825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:18,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1730 Invalid, 5870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1045 Valid, 4825 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:30:18,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11569 states. [2025-03-16 15:30:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11569 to 11516. [2025-03-16 15:30:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11516 states, 11515 states have (on average 1.4298740772904908) internal successors, (16465), 11515 states have internal predecessors, (16465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11516 states to 11516 states and 16465 transitions. [2025-03-16 15:30:18,414 INFO L78 Accepts]: Start accepts. Automaton has 11516 states and 16465 transitions. Word has length 109 [2025-03-16 15:30:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:18,415 INFO L471 AbstractCegarLoop]: Abstraction has 11516 states and 16465 transitions. [2025-03-16 15:30:18,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:18,416 INFO L276 IsEmpty]: Start isEmpty. Operand 11516 states and 16465 transitions. [2025-03-16 15:30:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 15:30:18,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:18,420 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:30:18,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:18,421 INFO L85 PathProgramCache]: Analyzing trace with hash -982172350, now seen corresponding path program 1 times [2025-03-16 15:30:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740036180] [2025-03-16 15:30:18,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:18,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 15:30:18,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 15:30:18,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:18,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740036180] [2025-03-16 15:30:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740036180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:18,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:18,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58399268] [2025-03-16 15:30:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:18,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:18,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:18,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:18,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:18,554 INFO L87 Difference]: Start difference. First operand 11516 states and 16465 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:23,223 INFO L93 Difference]: Finished difference Result 34167 states and 48916 transitions. [2025-03-16 15:30:23,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:23,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-16 15:30:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:23,267 INFO L225 Difference]: With dead ends: 34167 [2025-03-16 15:30:23,267 INFO L226 Difference]: Without dead ends: 22652 [2025-03-16 15:30:23,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:23,275 INFO L435 NwaCegarLoop]: 1803 mSDtfsCounter, 1748 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4312 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1748 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 5742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:23,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1748 Valid, 2075 Invalid, 5742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4312 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:30:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2025-03-16 15:30:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 22635. [2025-03-16 15:30:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22635 states, 22634 states have (on average 1.2716709375276134) internal successors, (28783), 22634 states have internal predecessors, (28783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22635 states to 22635 states and 28783 transitions. [2025-03-16 15:30:23,513 INFO L78 Accepts]: Start accepts. Automaton has 22635 states and 28783 transitions. Word has length 132 [2025-03-16 15:30:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:23,513 INFO L471 AbstractCegarLoop]: Abstraction has 22635 states and 28783 transitions. [2025-03-16 15:30:23,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 22635 states and 28783 transitions. [2025-03-16 15:30:23,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-16 15:30:23,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:23,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:23,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:30:23,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:23,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1596413696, now seen corresponding path program 1 times [2025-03-16 15:30:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:23,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144169090] [2025-03-16 15:30:23,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:23,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:23,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-16 15:30:23,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-16 15:30:23,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:23,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:23,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144169090] [2025-03-16 15:30:23,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144169090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:23,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:23,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:23,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573293800] [2025-03-16 15:30:23,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:23,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:23,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:23,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:23,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:23,664 INFO L87 Difference]: Start difference. First operand 22635 states and 28783 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:28,391 INFO L93 Difference]: Finished difference Result 67251 states and 85518 transitions. [2025-03-16 15:30:28,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:28,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-03-16 15:30:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:28,451 INFO L225 Difference]: With dead ends: 67251 [2025-03-16 15:30:28,451 INFO L226 Difference]: Without dead ends: 44617 [2025-03-16 15:30:28,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:28,465 INFO L435 NwaCegarLoop]: 1667 mSDtfsCounter, 1467 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 4395 mSolverCounterSat, 1425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 5820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1425 IncrementalHoareTripleChecker+Valid, 4395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:28,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1886 Invalid, 5820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1425 Valid, 4395 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:30:28,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44617 states. [2025-03-16 15:30:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44617 to 41837. [2025-03-16 15:30:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41837 states, 41836 states have (on average 1.1882589157663257) internal successors, (49712), 41836 states have internal predecessors, (49712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41837 states to 41837 states and 49712 transitions. [2025-03-16 15:30:28,832 INFO L78 Accepts]: Start accepts. Automaton has 41837 states and 49712 transitions. Word has length 173 [2025-03-16 15:30:28,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:28,832 INFO L471 AbstractCegarLoop]: Abstraction has 41837 states and 49712 transitions. [2025-03-16 15:30:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 2 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 41837 states and 49712 transitions. [2025-03-16 15:30:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-16 15:30:28,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:28,839 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:30:28,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:30:28,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1165316039, now seen corresponding path program 1 times [2025-03-16 15:30:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525725608] [2025-03-16 15:30:28,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:28,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-16 15:30:28,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-16 15:30:28,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:28,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 15:30:29,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525725608] [2025-03-16 15:30:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525725608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:29,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:30:29,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446822589] [2025-03-16 15:30:29,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:30:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:30:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:29,727 INFO L87 Difference]: Start difference. First operand 41837 states and 49712 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:36,505 INFO L93 Difference]: Finished difference Result 102864 states and 120385 transitions. [2025-03-16 15:30:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:30:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 402 [2025-03-16 15:30:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:36,568 INFO L225 Difference]: With dead ends: 102864 [2025-03-16 15:30:36,568 INFO L226 Difference]: Without dead ends: 61028 [2025-03-16 15:30:36,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:30:36,591 INFO L435 NwaCegarLoop]: 1801 mSDtfsCounter, 3755 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 9446 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 9690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 9446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:36,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2157 Invalid, 9690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 9446 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-16 15:30:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61028 states. [2025-03-16 15:30:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61028 to 58256. [2025-03-16 15:30:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58256 states, 58255 states have (on average 1.1517466311904558) internal successors, (67095), 58255 states have internal predecessors, (67095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:37,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58256 states to 58256 states and 67095 transitions. [2025-03-16 15:30:37,137 INFO L78 Accepts]: Start accepts. Automaton has 58256 states and 67095 transitions. Word has length 402 [2025-03-16 15:30:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:37,137 INFO L471 AbstractCegarLoop]: Abstraction has 58256 states and 67095 transitions. [2025-03-16 15:30:37,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 58256 states and 67095 transitions. [2025-03-16 15:30:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-16 15:30:37,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:37,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:30:37,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:30:37,144 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1138913625, now seen corresponding path program 1 times [2025-03-16 15:30:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934822596] [2025-03-16 15:30:37,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-16 15:30:37,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-16 15:30:37,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:37,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 15:30:37,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:37,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934822596] [2025-03-16 15:30:37,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934822596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:37,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:37,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:30:37,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142712258] [2025-03-16 15:30:37,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:37,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:30:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:37,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:30:37,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:37,783 INFO L87 Difference]: Start difference. First operand 58256 states and 67095 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:42,592 INFO L93 Difference]: Finished difference Result 119272 states and 136968 transitions. [2025-03-16 15:30:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:30:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 430 [2025-03-16 15:30:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:42,659 INFO L225 Difference]: With dead ends: 119272 [2025-03-16 15:30:42,659 INFO L226 Difference]: Without dead ends: 60986 [2025-03-16 15:30:42,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:42,693 INFO L435 NwaCegarLoop]: 1771 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:42,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2112 Invalid, 7327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7319 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-16 15:30:42,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60986 states. [2025-03-16 15:30:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60986 to 60986. [2025-03-16 15:30:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60986 states, 60985 states have (on average 1.1450356645076658) internal successors, (69830), 60985 states have internal predecessors, (69830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:43,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60986 states to 60986 states and 69830 transitions. [2025-03-16 15:30:43,240 INFO L78 Accepts]: Start accepts. Automaton has 60986 states and 69830 transitions. Word has length 430 [2025-03-16 15:30:43,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:43,241 INFO L471 AbstractCegarLoop]: Abstraction has 60986 states and 69830 transitions. [2025-03-16 15:30:43,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:43,241 INFO L276 IsEmpty]: Start isEmpty. Operand 60986 states and 69830 transitions. [2025-03-16 15:30:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-16 15:30:43,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:43,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:30:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:30:43,248 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -78453288, now seen corresponding path program 1 times [2025-03-16 15:30:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:43,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156224919] [2025-03-16 15:30:43,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:43,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:43,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-16 15:30:43,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-16 15:30:43,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:43,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:30:43,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:43,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156224919] [2025-03-16 15:30:43,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156224919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:43,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:43,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:30:43,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241740883] [2025-03-16 15:30:43,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:43,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:43,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:43,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:43,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:43,744 INFO L87 Difference]: Start difference. First operand 60986 states and 69830 transitions. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:48,517 INFO L93 Difference]: Finished difference Result 138486 states and 161681 transitions. [2025-03-16 15:30:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:48,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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 596 [2025-03-16 15:30:48,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:48,592 INFO L225 Difference]: With dead ends: 138486 [2025-03-16 15:30:48,592 INFO L226 Difference]: Without dead ends: 80231 [2025-03-16 15:30:48,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:48,620 INFO L435 NwaCegarLoop]: 2830 mSDtfsCounter, 1453 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4116 mSolverCounterSat, 1789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 3008 SdHoareTripleChecker+Invalid, 5905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1789 IncrementalHoareTripleChecker+Valid, 4116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:48,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 3008 Invalid, 5905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1789 Valid, 4116 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:30:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80231 states. [2025-03-16 15:30:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80231 to 78761. [2025-03-16 15:30:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78761 states, 78760 states have (on average 1.1383824276282377) internal successors, (89659), 78760 states have internal predecessors, (89659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78761 states to 78761 states and 89659 transitions. [2025-03-16 15:30:49,250 INFO L78 Accepts]: Start accepts. Automaton has 78761 states and 89659 transitions. Word has length 596 [2025-03-16 15:30:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 78761 states and 89659 transitions. [2025-03-16 15:30:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 78761 states and 89659 transitions. [2025-03-16 15:30:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 742 [2025-03-16 15:30:49,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:49,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:30:49,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:30:49,257 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:49,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:49,260 INFO L85 PathProgramCache]: Analyzing trace with hash -833246971, now seen corresponding path program 1 times [2025-03-16 15:30:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:49,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592471023] [2025-03-16 15:30:49,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:49,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:49,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-03-16 15:30:49,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-03-16 15:30:49,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:49,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 67 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:30:50,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:50,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592471023] [2025-03-16 15:30:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592471023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:30:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009875696] [2025-03-16 15:30:50,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:50,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:30:50,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:30:50,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:30:50,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 15:30:50,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 741 statements into 1 equivalence classes. [2025-03-16 15:30:50,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 741 of 741 statements. [2025-03-16 15:30:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:50,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:30:50,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:30:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:30:50,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:30:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009875696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:30:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:30:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867701052] [2025-03-16 15:30:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:50,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:50,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:30:50,935 INFO L87 Difference]: Start difference. First operand 78761 states and 89659 transitions. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:55,724 INFO L93 Difference]: Finished difference Result 191675 states and 220658 transitions. [2025-03-16 15:30:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:55,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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 741 [2025-03-16 15:30:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:55,871 INFO L225 Difference]: With dead ends: 191675 [2025-03-16 15:30:55,871 INFO L226 Difference]: Without dead ends: 115645 [2025-03-16 15:30:55,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 740 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-16 15:30:55,934 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 1542 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5060 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 6073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 5060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:55,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1650 Invalid, 6073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 5060 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:30:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115645 states. [2025-03-16 15:30:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115645 to 108791. [2025-03-16 15:30:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108791 states, 108790 states have (on average 1.1403345895762478) internal successors, (124057), 108790 states have internal predecessors, (124057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108791 states to 108791 states and 124057 transitions. [2025-03-16 15:30:56,940 INFO L78 Accepts]: Start accepts. Automaton has 108791 states and 124057 transitions. Word has length 741 [2025-03-16 15:30:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 108791 states and 124057 transitions. [2025-03-16 15:30:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 108791 states and 124057 transitions. [2025-03-16 15:30:56,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 823 [2025-03-16 15:30:56,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:56,947 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:30:56,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 15:30:57,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 15:30:57,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:57,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:57,148 INFO L85 PathProgramCache]: Analyzing trace with hash -417828282, now seen corresponding path program 1 times [2025-03-16 15:30:57,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:57,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266347171] [2025-03-16 15:30:57,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:57,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:57,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 822 statements into 1 equivalence classes. [2025-03-16 15:30:57,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 822 of 822 statements. [2025-03-16 15:30:57,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:57,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2025-03-16 15:30:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266347171] [2025-03-16 15:30:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266347171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574056512] [2025-03-16 15:30:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:57,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:57,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:57,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:57,479 INFO L87 Difference]: Start difference. First operand 108791 states and 124057 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:02,074 INFO L93 Difference]: Finished difference Result 242178 states and 275887 transitions. [2025-03-16 15:31:02,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:02,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 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 822 [2025-03-16 15:31:02,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:02,208 INFO L225 Difference]: With dead ends: 242178 [2025-03-16 15:31:02,208 INFO L226 Difference]: Without dead ends: 136118 [2025-03-16 15:31:02,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:02,244 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 1385 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 5572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1645 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:02,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 780 Invalid, 5572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1645 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 15:31:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136118 states. [2025-03-16 15:31:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136118 to 136093. [2025-03-16 15:31:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136093 states, 136092 states have (on average 1.107728595361961) internal successors, (150753), 136092 states have internal predecessors, (150753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136093 states to 136093 states and 150753 transitions. [2025-03-16 15:31:03,647 INFO L78 Accepts]: Start accepts. Automaton has 136093 states and 150753 transitions. Word has length 822 [2025-03-16 15:31:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 136093 states and 150753 transitions. [2025-03-16 15:31:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 2 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 136093 states and 150753 transitions. [2025-03-16 15:31:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 829 [2025-03-16 15:31:03,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:03,659 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:31:03,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:31:03,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:03,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:03,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1516809845, now seen corresponding path program 1 times [2025-03-16 15:31:03,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:03,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344617036] [2025-03-16 15:31:03,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:03,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:03,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 828 statements into 1 equivalence classes. [2025-03-16 15:31:03,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 828 of 828 statements. [2025-03-16 15:31:03,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:03,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-03-16 15:31:04,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:04,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344617036] [2025-03-16 15:31:04,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344617036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:04,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:04,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:31:04,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399702338] [2025-03-16 15:31:04,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:04,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:31:04,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:04,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:31:04,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:04,339 INFO L87 Difference]: Start difference. First operand 136093 states and 150753 transitions. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:31:09,027 INFO L93 Difference]: Finished difference Result 302233 states and 337149 transitions. [2025-03-16 15:31:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:31:09,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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 828 [2025-03-16 15:31:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:31:09,243 INFO L225 Difference]: With dead ends: 302233 [2025-03-16 15:31:09,243 INFO L226 Difference]: Without dead ends: 167504 [2025-03-16 15:31:09,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:31:09,332 INFO L435 NwaCegarLoop]: 2985 mSDtfsCounter, 1517 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 3701 mSolverCounterSat, 1636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 3173 SdHoareTripleChecker+Invalid, 5337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1636 IncrementalHoareTripleChecker+Valid, 3701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:31:09,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 3173 Invalid, 5337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1636 Valid, 3701 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 15:31:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167504 states. [2025-03-16 15:31:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167504 to 166125. [2025-03-16 15:31:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166125 states, 166124 states have (on average 1.0949290891141557) internal successors, (181894), 166124 states have internal predecessors, (181894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166125 states to 166125 states and 181894 transitions. [2025-03-16 15:31:11,194 INFO L78 Accepts]: Start accepts. Automaton has 166125 states and 181894 transitions. Word has length 828 [2025-03-16 15:31:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:31:11,195 INFO L471 AbstractCegarLoop]: Abstraction has 166125 states and 181894 transitions. [2025-03-16 15:31:11,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:31:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 166125 states and 181894 transitions. [2025-03-16 15:31:11,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2025-03-16 15:31:11,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:31:11,202 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:31:11,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:31:11,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:31:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:31:11,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1495824795, now seen corresponding path program 1 times [2025-03-16 15:31:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:31:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140940862] [2025-03-16 15:31:11,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:31:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:31:11,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 895 statements into 1 equivalence classes. [2025-03-16 15:31:11,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 895 of 895 statements. [2025-03-16 15:31:11,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:31:11,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:31:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-16 15:31:11,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:31:11,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140940862] [2025-03-16 15:31:11,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140940862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:31:11,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:31:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:31:11,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110600712] [2025-03-16 15:31:11,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:31:11,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:31:11,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:31:11,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:31:11,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:31:11,773 INFO L87 Difference]: Start difference. First operand 166125 states and 181894 transitions. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)