./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label18.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_label18.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 d37cc054943fa8b1eb7628e7c1bb2a31caa49744b497c911cc2a7e740f8d544d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:29:01,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:29:01,570 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:01,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:29:01,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:29:01,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:29:01,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:29:01,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:29:01,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:29:01,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:29:01,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:29:01,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:29:01,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:29:01,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:29:01,597 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:29:01,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:29:01,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:29:01,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:29:01,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:29:01,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:29:01,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:29:01,599 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:29:01,599 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:29:01,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:29:01,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:29:01,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:29:01,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:29:01,600 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 -> d37cc054943fa8b1eb7628e7c1bb2a31caa49744b497c911cc2a7e740f8d544d [2025-03-16 15:29:01,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:29:01,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:29:01,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:29:01,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:29:01,838 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:29:01,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label18.c [2025-03-16 15:29:02,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f78794/b1c93e285da54b758c25dab6bb744568/FLAGe5bfb9cf8 [2025-03-16 15:29:03,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:29:03,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label18.c [2025-03-16 15:29:03,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f78794/b1c93e285da54b758c25dab6bb744568/FLAGe5bfb9cf8 [2025-03-16 15:29:04,030 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f78794/b1c93e285da54b758c25dab6bb744568 [2025-03-16 15:29:04,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:29:04,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:29:04,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:29:04,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:29:04,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:29:04,039 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:29:04" (1/1) ... [2025-03-16 15:29:04,040 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e71e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:04, skipping insertion in model container [2025-03-16 15:29:04,040 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:29:04" (1/1) ... [2025-03-16 15:29:04,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:29:04,383 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_label18.c[4201,4214] [2025-03-16 15:29:05,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:29:05,065 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:29:05,077 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_label18.c[4201,4214] [2025-03-16 15:29:05,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:29:05,542 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:29:05,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:05 WrapperNode [2025-03-16 15:29:05,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:29:05,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:29:05,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:29:05,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:29:05,549 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:05" (1/1) ... [2025-03-16 15:29:05,601 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:05" (1/1) ... [2025-03-16 15:29:06,115 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-03-16 15:29:06,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:29:06,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:29:06,117 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:29:06,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:29:06,123 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:05" (1/1) ... [2025-03-16 15:29:06,124 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:05" (1/1) ... [2025-03-16 15:29:06,229 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:05" (1/1) ... [2025-03-16 15:29:06,494 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:06,494 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:05" (1/1) ... [2025-03-16 15:29:06,494 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:05" (1/1) ... [2025-03-16 15:29:06,796 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:05" (1/1) ... [2025-03-16 15:29:06,821 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:05" (1/1) ... [2025-03-16 15:29:06,849 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:05" (1/1) ... [2025-03-16 15:29:06,874 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:05" (1/1) ... [2025-03-16 15:29:06,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:29:06,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:29:06,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:29:06,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:29:06,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:05" (1/1) ... [2025-03-16 15:29:06,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:29:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:29:06,974 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:06,976 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:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:29:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:29:06,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:29:06,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:29:07,041 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:29:07,042 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:29:12,540 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6717: havoc calculate_output4_#t~ret14#1; [2025-03-16 15:29:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3435: havoc calculate_output2_#t~ret12#1; [2025-03-16 15:29:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: havoc calculate_output_#t~ret11#1; [2025-03-16 15:29:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8350: havoc calculate_output5_#t~ret15#1; [2025-03-16 15:29:12,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5079: havoc calculate_output3_#t~ret13#1; [2025-03-16 15:29:12,824 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-03-16 15:29:12,825 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:29:12,862 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:29:12,865 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:29:12,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:29:12 BoogieIcfgContainer [2025-03-16 15:29:12,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:29:12,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:29:12,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:29:12,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:29:12,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:29:04" (1/3) ... [2025-03-16 15:29:12,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9e7716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:29:12, skipping insertion in model container [2025-03-16 15:29:12,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:29:05" (2/3) ... [2025-03-16 15:29:12,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9e7716 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:29:12, skipping insertion in model container [2025-03-16 15:29:12,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:29:12" (3/3) ... [2025-03-16 15:29:12,872 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label18.c [2025-03-16 15:29:12,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:29:12,882 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label18.c that has 1 procedures, 1687 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:29:12,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:29:12,969 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;@3006f1f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:29:12,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:29:12,978 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:29:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:29:12,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:12,982 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] [2025-03-16 15:29:12,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:12,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:12,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2084359600, now seen corresponding path program 1 times [2025-03-16 15:29:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:12,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991883048] [2025-03-16 15:29:12,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:12,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:13,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:29:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:29:13,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:13,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:13,098 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:29:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991883048] [2025-03-16 15:29:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991883048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:29:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140702168] [2025-03-16 15:29:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:13,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:29:13,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:13,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:29:13,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:29:13,124 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:29:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:13,237 INFO L93 Difference]: Finished difference Result 3373 states and 6405 transitions. [2025-03-16 15:29:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:29:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-16 15:29:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:13,258 INFO L225 Difference]: With dead ends: 3373 [2025-03-16 15:29:13,259 INFO L226 Difference]: Without dead ends: 1684 [2025-03-16 15:29:13,266 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:29:13,268 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:29:13,270 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:29:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2025-03-16 15:29:13,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2025-03-16 15:29:13,356 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:29:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 3138 transitions. [2025-03-16 15:29:13,367 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 3138 transitions. Word has length 29 [2025-03-16 15:29:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:13,368 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 3138 transitions. [2025-03-16 15:29:13,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:29:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 3138 transitions. [2025-03-16 15:29:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 15:29:13,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:13,369 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] [2025-03-16 15:29:13,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:29:13,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:13,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2099495888, now seen corresponding path program 1 times [2025-03-16 15:29:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750311592] [2025-03-16 15:29:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:13,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 15:29:13,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 15:29:13,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:13,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:13,552 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:29:13,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:13,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750311592] [2025-03-16 15:29:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750311592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:29:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898663496] [2025-03-16 15:29:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:13,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:13,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:13,556 INFO L87 Difference]: Start difference. First operand 1684 states and 3138 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:29:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:18,655 INFO L93 Difference]: Finished difference Result 4845 states and 9098 transitions. [2025-03-16 15:29:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-16 15:29:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:18,666 INFO L225 Difference]: With dead ends: 4845 [2025-03-16 15:29:18,666 INFO L226 Difference]: Without dead ends: 3162 [2025-03-16 15:29:18,669 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:29:18,669 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 1501 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 4610 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 5673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 4610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:18,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1475 Invalid, 5673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 4610 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-03-16 15:29:18,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2025-03-16 15:29:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3122. [2025-03-16 15:29:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3122 states, 3121 states have (on average 1.6270426145466197) internal successors, (5078), 3121 states have internal predecessors, (5078), 0 states have call successors, (0), 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:29:18,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5078 transitions. [2025-03-16 15:29:18,727 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5078 transitions. Word has length 29 [2025-03-16 15:29:18,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:18,727 INFO L471 AbstractCegarLoop]: Abstraction has 3122 states and 5078 transitions. [2025-03-16 15:29:18,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 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:29:18,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5078 transitions. [2025-03-16 15:29:18,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 15:29:18,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:18,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:29:18,729 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:18,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -861485293, now seen corresponding path program 1 times [2025-03-16 15:29:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:18,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932608522] [2025-03-16 15:29:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:18,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 15:29:18,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 15:29:18,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:18,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:29:19,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:19,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932608522] [2025-03-16 15:29:19,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932608522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:19,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:19,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121483944] [2025-03-16 15:29:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:19,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:29:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:19,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:29:19,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:29:19,039 INFO L87 Difference]: Start difference. First operand 3122 states and 5078 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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:29:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:25,575 INFO L93 Difference]: Finished difference Result 10374 states and 16596 transitions. [2025-03-16 15:29:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:29:25,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2025-03-16 15:29:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:25,596 INFO L225 Difference]: With dead ends: 10374 [2025-03-16 15:29:25,597 INFO L226 Difference]: Without dead ends: 7253 [2025-03-16 15:29:25,602 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:29:25,602 INFO L435 NwaCegarLoop]: 701 mSDtfsCounter, 4483 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 7002 mSolverCounterSat, 2736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 9738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2736 IncrementalHoareTripleChecker+Valid, 7002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:25,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 970 Invalid, 9738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2736 Valid, 7002 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-16 15:29:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-03-16 15:29:25,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7247. [2025-03-16 15:29:25,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7247 states, 7246 states have (on average 1.4748826939000828) internal successors, (10687), 7246 states have internal predecessors, (10687), 0 states have call successors, (0), 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:29:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7247 states to 7247 states and 10687 transitions. [2025-03-16 15:29:25,707 INFO L78 Accepts]: Start accepts. Automaton has 7247 states and 10687 transitions. Word has length 100 [2025-03-16 15:29:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 7247 states and 10687 transitions. [2025-03-16 15:29:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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:29:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7247 states and 10687 transitions. [2025-03-16 15:29:25,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-16 15:29:25,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:25,710 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:25,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:29:25,710 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:25,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:25,712 INFO L85 PathProgramCache]: Analyzing trace with hash -845121419, now seen corresponding path program 1 times [2025-03-16 15:29:25,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:25,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445554288] [2025-03-16 15:29:25,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:25,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-16 15:29:25,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-16 15:29:25,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:25,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:29:25,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:25,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445554288] [2025-03-16 15:29:25,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445554288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:25,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:25,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938840507] [2025-03-16 15:29:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:25,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:25,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:25,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:25,997 INFO L87 Difference]: Start difference. First operand 7247 states and 10687 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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:29:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:30,379 INFO L93 Difference]: Finished difference Result 15921 states and 25207 transitions. [2025-03-16 15:29:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2025-03-16 15:29:30,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:30,403 INFO L225 Difference]: With dead ends: 15921 [2025-03-16 15:29:30,403 INFO L226 Difference]: Without dead ends: 10041 [2025-03-16 15:29:30,411 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:29:30,412 INFO L435 NwaCegarLoop]: 2768 mSDtfsCounter, 1500 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4071 mSolverCounterSat, 1798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 5869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1798 IncrementalHoareTripleChecker+Valid, 4071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:30,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 2946 Invalid, 5869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1798 Valid, 4071 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 15:29:30,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2025-03-16 15:29:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 9997. [2025-03-16 15:29:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9997 states, 9996 states have (on average 1.4354741896758703) internal successors, (14349), 9996 states have internal predecessors, (14349), 0 states have call successors, (0), 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:29:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9997 states to 9997 states and 14349 transitions. [2025-03-16 15:29:30,543 INFO L78 Accepts]: Start accepts. Automaton has 9997 states and 14349 transitions. Word has length 236 [2025-03-16 15:29:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 9997 states and 14349 transitions. [2025-03-16 15:29:30,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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:29:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9997 states and 14349 transitions. [2025-03-16 15:29:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-16 15:29:30,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:30,550 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:29:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:29:30,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:30,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:30,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1264420468, now seen corresponding path program 1 times [2025-03-16 15:29:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116283578] [2025-03-16 15:29:30,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:30,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-16 15:29:30,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-16 15:29:30,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:30,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 15:29:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116283578] [2025-03-16 15:29:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116283578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:31,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:31,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:31,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15368945] [2025-03-16 15:29:31,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:31,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:29:31,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:31,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:29:31,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:29:31,178 INFO L87 Difference]: Start difference. First operand 9997 states and 14349 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:37,918 INFO L93 Difference]: Finished difference Result 25500 states and 38570 transitions. [2025-03-16 15:29:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:29:37,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 304 [2025-03-16 15:29:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:37,953 INFO L225 Difference]: With dead ends: 25500 [2025-03-16 15:29:37,954 INFO L226 Difference]: Without dead ends: 16869 [2025-03-16 15:29:37,964 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:29:37,965 INFO L435 NwaCegarLoop]: 1798 mSDtfsCounter, 3755 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 9438 mSolverCounterSat, 1331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3755 SdHoareTripleChecker+Valid, 2152 SdHoareTripleChecker+Invalid, 10769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1331 IncrementalHoareTripleChecker+Valid, 9438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:37,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3755 Valid, 2152 Invalid, 10769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1331 Valid, 9438 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2025-03-16 15:29:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16869 states. [2025-03-16 15:29:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16869 to 16853. [2025-03-16 15:29:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16853 states, 16852 states have (on average 1.2965820080702588) internal successors, (21850), 16852 states have internal predecessors, (21850), 0 states have call successors, (0), 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:29:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16853 states to 16853 states and 21850 transitions. [2025-03-16 15:29:38,224 INFO L78 Accepts]: Start accepts. Automaton has 16853 states and 21850 transitions. Word has length 304 [2025-03-16 15:29:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:38,224 INFO L471 AbstractCegarLoop]: Abstraction has 16853 states and 21850 transitions. [2025-03-16 15:29:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16853 states and 21850 transitions. [2025-03-16 15:29:38,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-16 15:29:38,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:38,227 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:29:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:29:38,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:38,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1549152354, now seen corresponding path program 1 times [2025-03-16 15:29:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737770114] [2025-03-16 15:29:38,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:38,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-16 15:29:38,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-16 15:29:38,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:38,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 15:29:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:38,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737770114] [2025-03-16 15:29:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737770114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064744533] [2025-03-16 15:29:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:29:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:38,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:29:38,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:29:38,643 INFO L87 Difference]: Start difference. First operand 16853 states and 21850 transitions. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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:29:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:43,165 INFO L93 Difference]: Finished difference Result 31006 states and 40982 transitions. [2025-03-16 15:29:43,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:29:43,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 332 [2025-03-16 15:29:43,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:43,185 INFO L225 Difference]: With dead ends: 31006 [2025-03-16 15:29:43,185 INFO L226 Difference]: Without dead ends: 16853 [2025-03-16 15:29:43,192 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:29:43,193 INFO L435 NwaCegarLoop]: 1764 mSDtfsCounter, 1138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 7315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 7323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:43,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2105 Invalid, 7323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7315 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:29:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16853 states. [2025-03-16 15:29:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16853 to 16853. [2025-03-16 15:29:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16853 states, 16852 states have (on average 1.2958105862805602) internal successors, (21837), 16852 states have internal predecessors, (21837), 0 states have call successors, (0), 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:29:43,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16853 states to 16853 states and 21837 transitions. [2025-03-16 15:29:43,333 INFO L78 Accepts]: Start accepts. Automaton has 16853 states and 21837 transitions. Word has length 332 [2025-03-16 15:29:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:43,334 INFO L471 AbstractCegarLoop]: Abstraction has 16853 states and 21837 transitions. [2025-03-16 15:29:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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:29:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16853 states and 21837 transitions. [2025-03-16 15:29:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-03-16 15:29:43,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:43,343 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:29:43,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:29:43,343 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:43,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:43,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1560069971, now seen corresponding path program 1 times [2025-03-16 15:29:43,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:43,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384009737] [2025-03-16 15:29:43,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:43,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:43,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-03-16 15:29:43,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-03-16 15:29:43,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:43,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-03-16 15:29:43,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:43,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384009737] [2025-03-16 15:29:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384009737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:43,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:43,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:29:43,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283201974] [2025-03-16 15:29:43,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:43,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:43,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:43,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:43,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:43,658 INFO L87 Difference]: Start difference. First operand 16853 states and 21837 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:48,199 INFO L93 Difference]: Finished difference Result 44816 states and 59665 transitions. [2025-03-16 15:29:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 584 [2025-03-16 15:29:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:48,249 INFO L225 Difference]: With dead ends: 44816 [2025-03-16 15:29:48,249 INFO L226 Difference]: Without dead ends: 30694 [2025-03-16 15:29:48,260 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:29:48,261 INFO L435 NwaCegarLoop]: 715 mSDtfsCounter, 2111 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5117 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2111 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 5551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:48,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2111 Valid, 985 Invalid, 5551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5117 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:29:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30694 states. [2025-03-16 15:29:48,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30694 to 30691. [2025-03-16 15:29:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30691 states, 30690 states have (on average 1.2910720104268492) internal successors, (39623), 30690 states have internal predecessors, (39623), 0 states have call successors, (0), 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:29:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30691 states to 30691 states and 39623 transitions. [2025-03-16 15:29:48,532 INFO L78 Accepts]: Start accepts. Automaton has 30691 states and 39623 transitions. Word has length 584 [2025-03-16 15:29:48,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:48,533 INFO L471 AbstractCegarLoop]: Abstraction has 30691 states and 39623 transitions. [2025-03-16 15:29:48,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:48,533 INFO L276 IsEmpty]: Start isEmpty. Operand 30691 states and 39623 transitions. [2025-03-16 15:29:48,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-03-16 15:29:48,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:48,541 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:29:48,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:29:48,542 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:48,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash -641489049, now seen corresponding path program 1 times [2025-03-16 15:29:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693328141] [2025-03-16 15:29:48,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:48,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-03-16 15:29:48,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-03-16 15:29:48,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:48,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:48,928 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-16 15:29:48,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:48,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693328141] [2025-03-16 15:29:48,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693328141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:48,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:48,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:29:48,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191309320] [2025-03-16 15:29:48,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:48,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:48,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:48,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:48,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:48,929 INFO L87 Difference]: Start difference. First operand 30691 states and 39623 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:53,614 INFO L93 Difference]: Finished difference Result 84821 states and 111440 transitions. [2025-03-16 15:29:53,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 611 [2025-03-16 15:29:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:53,674 INFO L225 Difference]: With dead ends: 84821 [2025-03-16 15:29:53,674 INFO L226 Difference]: Without dead ends: 56861 [2025-03-16 15:29:53,698 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:29:53,698 INFO L435 NwaCegarLoop]: 1800 mSDtfsCounter, 1354 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 4310 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 5740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:53,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 2071 Invalid, 5740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4310 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:29:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56861 states. [2025-03-16 15:29:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56861 to 51375. [2025-03-16 15:29:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51375 states, 51374 states have (on average 1.2071670494802818) internal successors, (62017), 51374 states have internal predecessors, (62017), 0 states have call successors, (0), 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:29:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51375 states to 51375 states and 62017 transitions. [2025-03-16 15:29:54,177 INFO L78 Accepts]: Start accepts. Automaton has 51375 states and 62017 transitions. Word has length 611 [2025-03-16 15:29:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:29:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 51375 states and 62017 transitions. [2025-03-16 15:29:54,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 2 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:29:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51375 states and 62017 transitions. [2025-03-16 15:29:54,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-03-16 15:29:54,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:29:54,184 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:29:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:29:54,184 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:29:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:29:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1662116891, now seen corresponding path program 1 times [2025-03-16 15:29:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:29:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167474438] [2025-03-16 15:29:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:29:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:29:54,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-03-16 15:29:54,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-03-16 15:29:54,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:29:54,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:29:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-16 15:29:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:29:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167474438] [2025-03-16 15:29:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167474438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:29:54,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:29:54,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:29:54,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642496425] [2025-03-16 15:29:54,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:29:54,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:29:54,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:29:54,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:29:54,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:29:54,599 INFO L87 Difference]: Start difference. First operand 51375 states and 62017 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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:29:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:29:59,359 INFO L93 Difference]: Finished difference Result 119256 states and 146667 transitions. [2025-03-16 15:29:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:29:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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 728 [2025-03-16 15:29:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:29:59,432 INFO L225 Difference]: With dead ends: 119256 [2025-03-16 15:29:59,432 INFO L226 Difference]: Without dead ends: 70612 [2025-03-16 15:29:59,453 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:29:59,453 INFO L435 NwaCegarLoop]: 3191 mSDtfsCounter, 1446 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5092 mSolverCounterSat, 970 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 6062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 970 IncrementalHoareTripleChecker+Valid, 5092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:29:59,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 3364 Invalid, 6062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [970 Valid, 5092 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-16 15:29:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70612 states. [2025-03-16 15:30:00,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70612 to 70529. [2025-03-16 15:30:00,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70529 states, 70528 states have (on average 1.1841396324863884) internal successors, (83515), 70528 states have internal predecessors, (83515), 0 states have call successors, (0), 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:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70529 states to 70529 states and 83515 transitions. [2025-03-16 15:30:00,170 INFO L78 Accepts]: Start accepts. Automaton has 70529 states and 83515 transitions. Word has length 728 [2025-03-16 15:30:00,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:00,172 INFO L471 AbstractCegarLoop]: Abstraction has 70529 states and 83515 transitions. [2025-03-16 15:30:00,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 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:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand 70529 states and 83515 transitions. [2025-03-16 15:30:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-03-16 15:30:00,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:00,176 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:00,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:30:00,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:00,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1485661931, now seen corresponding path program 1 times [2025-03-16 15:30:00,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:00,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111107431] [2025-03-16 15:30:00,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:00,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-03-16 15:30:00,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-03-16 15:30:00,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:00,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:01,051 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 55 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-16 15:30:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111107431] [2025-03-16 15:30:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111107431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:30:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27477774] [2025-03-16 15:30:01,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:01,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:30:01,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:30:01,054 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:01,056 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:01,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-03-16 15:30:01,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-03-16 15:30:01,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:01,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:01,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:30:01,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:30:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-16 15:30:01,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:30:01,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27477774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:01,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:30:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 15:30:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100228074] [2025-03-16 15:30:01,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:01,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:01,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:30:01,317 INFO L87 Difference]: Start difference. First operand 70529 states and 83515 transitions. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:05,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:05,872 INFO L93 Difference]: Finished difference Result 172471 states and 204278 transitions. [2025-03-16 15:30:05,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:05,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 735 [2025-03-16 15:30:05,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:05,996 INFO L225 Difference]: With dead ends: 172471 [2025-03-16 15:30:05,996 INFO L226 Difference]: Without dead ends: 104673 [2025-03-16 15:30:06,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 734 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:06,018 INFO L435 NwaCegarLoop]: 1519 mSDtfsCounter, 1547 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5061 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 5845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 5061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:06,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 1649 Invalid, 5845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 5061 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:30:06,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104673 states. [2025-03-16 15:30:06,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104673 to 97828. [2025-03-16 15:30:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97828 states, 97827 states have (on average 1.1772414568575138) internal successors, (115166), 97827 states have internal predecessors, (115166), 0 states have call successors, (0), 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:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97828 states to 97828 states and 115166 transitions. [2025-03-16 15:30:06,856 INFO L78 Accepts]: Start accepts. Automaton has 97828 states and 115166 transitions. Word has length 735 [2025-03-16 15:30:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:06,857 INFO L471 AbstractCegarLoop]: Abstraction has 97828 states and 115166 transitions. [2025-03-16 15:30:06,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:30:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97828 states and 115166 transitions. [2025-03-16 15:30:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 851 [2025-03-16 15:30:06,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:06,863 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:30:07,063 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:07,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:07,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:07,064 INFO L85 PathProgramCache]: Analyzing trace with hash 299893320, now seen corresponding path program 1 times [2025-03-16 15:30:07,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:07,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845847491] [2025-03-16 15:30:07,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:07,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 850 statements into 1 equivalence classes. [2025-03-16 15:30:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 850 of 850 statements. [2025-03-16 15:30:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-16 15:30:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845847491] [2025-03-16 15:30:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845847491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:07,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:30:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264004480] [2025-03-16 15:30:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:07,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:30:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:07,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:30:07,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:30:07,387 INFO L87 Difference]: Start difference. First operand 97828 states and 115166 transitions. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 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:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:11,756 INFO L93 Difference]: Finished difference Result 214772 states and 253493 transitions. [2025-03-16 15:30:11,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:30:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 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 850 [2025-03-16 15:30:11,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:12,091 INFO L225 Difference]: With dead ends: 214772 [2025-03-16 15:30:12,092 INFO L226 Difference]: Without dead ends: 119675 [2025-03-16 15:30:12,121 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:12,121 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 1385 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3926 mSolverCounterSat, 1877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1877 IncrementalHoareTripleChecker+Valid, 3926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:12,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 776 Invalid, 5803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1877 Valid, 3926 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-16 15:30:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119675 states. [2025-03-16 15:30:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119675 to 119654. [2025-03-16 15:30:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119654 states, 119653 states have (on average 1.1476686752526055) internal successors, (137322), 119653 states have internal predecessors, (137322), 0 states have call successors, (0), 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,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119654 states to 119654 states and 137322 transitions. [2025-03-16 15:30:13,674 INFO L78 Accepts]: Start accepts. Automaton has 119654 states and 137322 transitions. Word has length 850 [2025-03-16 15:30:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:13,675 INFO L471 AbstractCegarLoop]: Abstraction has 119654 states and 137322 transitions. [2025-03-16 15:30:13,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 2 states have internal predecessors, (592), 0 states have call successors, (0), 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,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119654 states and 137322 transitions. [2025-03-16 15:30:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2025-03-16 15:30:13,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:13,687 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:30:13,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:30:13,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:13,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -11939487, now seen corresponding path program 1 times [2025-03-16 15:30:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222428410] [2025-03-16 15:30:13,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-03-16 15:30:13,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-03-16 15:30:13,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:13,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-03-16 15:30:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222428410] [2025-03-16 15:30:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222428410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:30:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703727235] [2025-03-16 15:30:14,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:30:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:30:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:14,168 INFO L87 Difference]: Start difference. First operand 119654 states and 137322 transitions. Second operand has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:30:22,581 INFO L93 Difference]: Finished difference Result 397871 states and 463466 transitions. [2025-03-16 15:30:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:30:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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 936 [2025-03-16 15:30:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:30:22,872 INFO L225 Difference]: With dead ends: 397871 [2025-03-16 15:30:22,872 INFO L226 Difference]: Without dead ends: 280948 [2025-03-16 15:30:22,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:22,922 INFO L435 NwaCegarLoop]: 1031 mSDtfsCounter, 3360 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 8758 mSolverCounterSat, 2803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3360 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 11561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2803 IncrementalHoareTripleChecker+Valid, 8758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:30:22,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3360 Valid, 1302 Invalid, 11561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2803 Valid, 8758 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-03-16 15:30:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280948 states. [2025-03-16 15:30:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280948 to 278082. [2025-03-16 15:30:25,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278082 states, 278081 states have (on average 1.1276318770430198) internal successors, (313573), 278081 states have internal predecessors, (313573), 0 states have call successors, (0), 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:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278082 states to 278082 states and 313573 transitions. [2025-03-16 15:30:25,639 INFO L78 Accepts]: Start accepts. Automaton has 278082 states and 313573 transitions. Word has length 936 [2025-03-16 15:30:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:30:25,640 INFO L471 AbstractCegarLoop]: Abstraction has 278082 states and 313573 transitions. [2025-03-16 15:30:25,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 0 states have call successors, (0), 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:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 278082 states and 313573 transitions. [2025-03-16 15:30:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2025-03-16 15:30:25,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:30:25,660 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:30:25,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:30:25,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:30:25,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1035050417, now seen corresponding path program 1 times [2025-03-16 15:30:25,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:30:25,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594965383] [2025-03-16 15:30:25,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:30:25,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:30:25,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1012 statements into 1 equivalence classes. [2025-03-16 15:30:25,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1012 of 1012 statements. [2025-03-16 15:30:25,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:30:25,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:30:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 543 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-03-16 15:30:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:30:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594965383] [2025-03-16 15:30:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594965383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:30:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:30:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:30:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115092485] [2025-03-16 15:30:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:30:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:30:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:30:26,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:30:26,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:30:26,411 INFO L87 Difference]: Start difference. First operand 278082 states and 313573 transitions. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)