./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.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 5f06498eb80e802eba7f35e8b89bda4b42e6ab2a6a5c4854a4d889d75d8cafdd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:18:21,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:18:21,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:18:21,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:18:21,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:18:21,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:18:21,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:18:21,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:18:21,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:18:21,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:18:21,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:18:21,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:18:21,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:18:21,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:18:21,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:18:21,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:18:21,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:18:21,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:18:21,676 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 -> 5f06498eb80e802eba7f35e8b89bda4b42e6ab2a6a5c4854a4d889d75d8cafdd [2025-03-03 16:18:21,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:18:21,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:18:21,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:18:21,898 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:18:21,898 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:18:21,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:18:23,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e546e1ba/285c267a394a4aefb9daec06e5b9d972/FLAG622f28191 [2025-03-03 16:18:23,385 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:18:23,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:18:23,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e546e1ba/285c267a394a4aefb9daec06e5b9d972/FLAG622f28191 [2025-03-03 16:18:23,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e546e1ba/285c267a394a4aefb9daec06e5b9d972 [2025-03-03 16:18:23,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:18:23,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:18:23,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:18:23,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:18:23,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:18:23,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:18:23" (1/1) ... [2025-03-03 16:18:23,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3730fdd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:23, skipping insertion in model container [2025-03-03 16:18:23,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:18:23" (1/1) ... [2025-03-03 16:18:23,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:18:24,024 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c[26888,26901] [2025-03-03 16:18:24,059 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c[28763,28776] [2025-03-03 16:18:24,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:18:24,462 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:18:24,495 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c[26888,26901] [2025-03-03 16:18:24,499 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/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c[28763,28776] [2025-03-03 16:18:24,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:18:24,759 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:18:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24 WrapperNode [2025-03-03 16:18:24,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:18:24,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:18:24,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:18:24,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:18:24,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:24,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,071 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5285 [2025-03-03 16:18:25,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:18:25,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:18:25,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:18:25,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:18:25,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,236 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-03 16:18:25,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:18:25,514 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:18:25,514 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:18:25,514 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:18:25,515 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (1/1) ... [2025-03-03 16:18:25,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:18:25,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:18:25,538 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-03 16:18:25,541 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-03 16:18:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:18:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:18:25,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:18:25,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:18:25,666 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:18:25,668 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:18:29,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2375: havoc calculate_output_#t~ret49#1; [2025-03-03 16:18:29,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc calculate_output2_#t~ret50#1; [2025-03-03 16:18:29,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5344: havoc calculate_output3_#t~ret51#1; [2025-03-03 16:18:29,252 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-03-03 16:18:29,252 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:18:29,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:18:29,274 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:18:29,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:18:29 BoogieIcfgContainer [2025-03-03 16:18:29,274 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:18:29,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:18:29,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:18:29,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:18:29,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:18:23" (1/3) ... [2025-03-03 16:18:29,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df52258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:18:29, skipping insertion in model container [2025-03-03 16:18:29,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:18:24" (2/3) ... [2025-03-03 16:18:29,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df52258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:18:29, skipping insertion in model container [2025-03-03 16:18:29,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:18:29" (3/3) ... [2025-03-03 16:18:29,287 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c [2025-03-03 16:18:29,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:18:29,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label00.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:18:29,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:18:29,374 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;@48244781, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:18:29,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:18:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 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-03 16:18:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 16:18:29,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:29,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:18:29,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:29,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:29,390 INFO L85 PathProgramCache]: Analyzing trace with hash -180843316, now seen corresponding path program 1 times [2025-03-03 16:18:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905155799] [2025-03-03 16:18:29,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:29,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 16:18:29,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 16:18:29,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:29,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:29,671 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-03 16:18:29,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905155799] [2025-03-03 16:18:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905155799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:18:29,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852298726] [2025-03-03 16:18:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:29,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:29,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:29,694 INFO L87 Difference]: Start difference. First operand has 948 states, 945 states have (on average 1.9015873015873015) internal successors, (1797), 947 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 16:18:32,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:32,298 INFO L93 Difference]: Finished difference Result 2583 states and 4964 transitions. [2025-03-03 16:18:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:32,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2025-03-03 16:18:32,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:32,313 INFO L225 Difference]: With dead ends: 2583 [2025-03-03 16:18:32,313 INFO L226 Difference]: Without dead ends: 1634 [2025-03-03 16:18:32,319 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-03 16:18:32,321 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 1047 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:32,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 711 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:18:32,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-03 16:18:32,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-03 16:18:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.650735294117647) internal successors, (2694), 1633 states have internal predecessors, (2694), 0 states have call successors, (0), 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-03 16:18:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2694 transitions. [2025-03-03 16:18:32,413 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2694 transitions. Word has length 16 [2025-03-03 16:18:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2694 transitions. [2025-03-03 16:18:32,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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-03 16:18:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2694 transitions. [2025-03-03 16:18:32,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 16:18:32,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:32,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:18:32,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:18:32,416 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash -10128820, now seen corresponding path program 1 times [2025-03-03 16:18:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153782997] [2025-03-03 16:18:32,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:32,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:32,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 16:18:32,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 16:18:32,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:32,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:32,683 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-03 16:18:32,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:32,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153782997] [2025-03-03 16:18:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153782997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:18:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801551172] [2025-03-03 16:18:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:18:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:32,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:18:32,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:18:32,685 INFO L87 Difference]: Start difference. First operand 1634 states and 2694 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 16:18:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:32,746 INFO L93 Difference]: Finished difference Result 1700 states and 2798 transitions. [2025-03-03 16:18:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:18:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 16:18:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:32,752 INFO L225 Difference]: With dead ends: 1700 [2025-03-03 16:18:32,752 INFO L226 Difference]: Without dead ends: 1634 [2025-03-03 16:18:32,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-03 16:18:32,753 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6594 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:32,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6594 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:32,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-03 16:18:32,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1634. [2025-03-03 16:18:32,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1632 states have (on average 1.6133578431372548) internal successors, (2633), 1633 states have internal predecessors, (2633), 0 states have call successors, (0), 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-03 16:18:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2633 transitions. [2025-03-03 16:18:32,839 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2633 transitions. Word has length 30 [2025-03-03 16:18:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:32,839 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2633 transitions. [2025-03-03 16:18:32,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 16:18:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2633 transitions. [2025-03-03 16:18:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 16:18:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:32,843 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:18:32,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:18:32,843 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:32,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:32,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2054061547, now seen corresponding path program 1 times [2025-03-03 16:18:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:32,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662513808] [2025-03-03 16:18:32,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:32,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:32,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 16:18:32,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 16:18:32,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:32,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:32,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:18:32,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:32,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662513808] [2025-03-03 16:18:32,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662513808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:32,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:32,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317609184] [2025-03-03 16:18:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:32,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:32,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:32,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:32,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:32,992 INFO L87 Difference]: Start difference. First operand 1634 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 16:18:35,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:35,344 INFO L93 Difference]: Finished difference Result 4640 states and 7560 transitions. [2025-03-03 16:18:35,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:35,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-03-03 16:18:35,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:35,357 INFO L225 Difference]: With dead ends: 4640 [2025-03-03 16:18:35,357 INFO L226 Difference]: Without dead ends: 3136 [2025-03-03 16:18:35,360 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-03 16:18:35,363 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 753 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:35,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1491 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 16:18:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3136 states. [2025-03-03 16:18:35,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3136 to 3136. [2025-03-03 16:18:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3136 states, 3134 states have (on average 1.5280791320995533) internal successors, (4789), 3135 states have internal predecessors, (4789), 0 states have call successors, (0), 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-03 16:18:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3136 states to 3136 states and 4789 transitions. [2025-03-03 16:18:35,418 INFO L78 Accepts]: Start accepts. Automaton has 3136 states and 4789 transitions. Word has length 87 [2025-03-03 16:18:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 3136 states and 4789 transitions. [2025-03-03 16:18:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-03 16:18:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3136 states and 4789 transitions. [2025-03-03 16:18:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:18:35,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:35,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:35,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:18:35,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:35,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash -551956336, now seen corresponding path program 1 times [2025-03-03 16:18:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:35,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576425891] [2025-03-03 16:18:35,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:35,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:35,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:18:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:18:35,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:35,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:35,736 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-03 16:18:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:35,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576425891] [2025-03-03 16:18:35,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576425891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:35,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:35,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:18:35,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479985451] [2025-03-03 16:18:35,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:35,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:18:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:35,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:18:35,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:18:35,738 INFO L87 Difference]: Start difference. First operand 3136 states and 4789 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03 16:18:36,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:36,183 INFO L93 Difference]: Finished difference Result 4128 states and 6389 transitions. [2025-03-03 16:18:36,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:18:36,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 16:18:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:36,197 INFO L225 Difference]: With dead ends: 4128 [2025-03-03 16:18:36,198 INFO L226 Difference]: Without dead ends: 4066 [2025-03-03 16:18:36,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:18:36,201 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 13409 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13409 SdHoareTripleChecker+Valid, 6219 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:36,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13409 Valid, 6219 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 16:18:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4066 states. [2025-03-03 16:18:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4066 to 3196. [2025-03-03 16:18:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3196 states, 3194 states have (on average 1.5297432686286787) internal successors, (4886), 3195 states have internal predecessors, (4886), 0 states have call successors, (0), 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-03 16:18:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3196 states to 3196 states and 4886 transitions. [2025-03-03 16:18:36,264 INFO L78 Accepts]: Start accepts. Automaton has 3196 states and 4886 transitions. Word has length 90 [2025-03-03 16:18:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:36,265 INFO L471 AbstractCegarLoop]: Abstraction has 3196 states and 4886 transitions. [2025-03-03 16:18:36,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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-03 16:18:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 3196 states and 4886 transitions. [2025-03-03 16:18:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:18:36,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:36,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:18:36,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:18:36,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:36,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1681107260, now seen corresponding path program 1 times [2025-03-03 16:18:36,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601950098] [2025-03-03 16:18:36,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:36,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:36,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:18:36,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:18:36,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:36,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:18:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:36,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601950098] [2025-03-03 16:18:36,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601950098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:36,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:36,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:18:36,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568553725] [2025-03-03 16:18:36,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:36,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:36,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:36,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:36,429 INFO L87 Difference]: Start difference. First operand 3196 states and 4886 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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-03 16:18:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:38,691 INFO L93 Difference]: Finished difference Result 9206 states and 14125 transitions. [2025-03-03 16:18:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:38,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-03 16:18:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:38,708 INFO L225 Difference]: With dead ends: 9206 [2025-03-03 16:18:38,709 INFO L226 Difference]: Without dead ends: 6200 [2025-03-03 16:18:38,712 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-03 16:18:38,712 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 860 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:38,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 787 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 16:18:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6200 states. [2025-03-03 16:18:38,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6200 to 6200. [2025-03-03 16:18:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6200 states, 6198 states have (on average 1.3368828654404648) internal successors, (8286), 6199 states have internal predecessors, (8286), 0 states have call successors, (0), 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-03 16:18:38,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 8286 transitions. [2025-03-03 16:18:38,802 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 8286 transitions. Word has length 90 [2025-03-03 16:18:38,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:38,802 INFO L471 AbstractCegarLoop]: Abstraction has 6200 states and 8286 transitions. [2025-03-03 16:18:38,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 0 states have call successors, (0), 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-03 16:18:38,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 8286 transitions. [2025-03-03 16:18:38,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:18:38,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:38,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:38,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:18:38,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:38,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1028708245, now seen corresponding path program 1 times [2025-03-03 16:18:38,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:38,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559490434] [2025-03-03 16:18:38,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:38,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:38,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:18:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:18:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:38,914 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-03 16:18:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:38,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559490434] [2025-03-03 16:18:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559490434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:38,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:38,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:38,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434030128] [2025-03-03 16:18:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:38,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:38,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:38,919 INFO L87 Difference]: Start difference. First operand 6200 states and 8286 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:18:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:38,965 INFO L93 Difference]: Finished difference Result 6433 states and 8661 transitions. [2025-03-03 16:18:38,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:38,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 16:18:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:38,981 INFO L225 Difference]: With dead ends: 6433 [2025-03-03 16:18:38,981 INFO L226 Difference]: Without dead ends: 6311 [2025-03-03 16:18:38,984 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-03 16:18:38,985 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1508 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1508 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:38,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1508 Valid, 1695 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6311 states. [2025-03-03 16:18:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6311 to 6307. [2025-03-03 16:18:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6307 states, 6305 states have (on average 1.341157811260904) internal successors, (8456), 6306 states have internal predecessors, (8456), 0 states have call successors, (0), 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-03 16:18:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6307 states to 6307 states and 8456 transitions. [2025-03-03 16:18:39,073 INFO L78 Accepts]: Start accepts. Automaton has 6307 states and 8456 transitions. Word has length 92 [2025-03-03 16:18:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:39,073 INFO L471 AbstractCegarLoop]: Abstraction has 6307 states and 8456 transitions. [2025-03-03 16:18:39,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:18:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6307 states and 8456 transitions. [2025-03-03 16:18:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:18:39,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:39,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:18:39,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -996385010, now seen corresponding path program 1 times [2025-03-03 16:18:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698672459] [2025-03-03 16:18:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:18:39,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:18:39,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:39,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:39,468 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-03 16:18:39,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:39,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698672459] [2025-03-03 16:18:39,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698672459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:18:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191768773] [2025-03-03 16:18:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:39,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:18:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:39,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:18:39,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:18:39,470 INFO L87 Difference]: Start difference. First operand 6307 states and 8456 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:18:39,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:39,812 INFO L93 Difference]: Finished difference Result 6538 states and 8824 transitions. [2025-03-03 16:18:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:18:39,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-03-03 16:18:39,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:39,834 INFO L225 Difference]: With dead ends: 6538 [2025-03-03 16:18:39,835 INFO L226 Difference]: Without dead ends: 6309 [2025-03-03 16:18:39,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-03 16:18:39,837 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 7629 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7629 SdHoareTripleChecker+Valid, 2282 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:39,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7629 Valid, 2282 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:18:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2025-03-03 16:18:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 6307. [2025-03-03 16:18:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6307 states, 6305 states have (on average 1.3408406026962727) internal successors, (8454), 6306 states have internal predecessors, (8454), 0 states have call successors, (0), 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-03 16:18:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6307 states to 6307 states and 8454 transitions. [2025-03-03 16:18:39,932 INFO L78 Accepts]: Start accepts. Automaton has 6307 states and 8454 transitions. Word has length 92 [2025-03-03 16:18:39,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:39,932 INFO L471 AbstractCegarLoop]: Abstraction has 6307 states and 8454 transitions. [2025-03-03 16:18:39,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 10 states have internal predecessors, (92), 0 states have call successors, (0), 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-03 16:18:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6307 states and 8454 transitions. [2025-03-03 16:18:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:18:39,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:39,933 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:39,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:18:39,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:39,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:39,933 INFO L85 PathProgramCache]: Analyzing trace with hash -792626504, now seen corresponding path program 1 times [2025-03-03 16:18:39,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:39,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210828491] [2025-03-03 16:18:39,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:39,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:40,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:18:40,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:18:40,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:40,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:40,274 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-03 16:18:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210828491] [2025-03-03 16:18:40,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210828491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:40,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:40,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:18:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410224082] [2025-03-03 16:18:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:18:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:40,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:18:40,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:18:40,275 INFO L87 Difference]: Start difference. First operand 6307 states and 8454 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-03 16:18:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:40,330 INFO L93 Difference]: Finished difference Result 6315 states and 8463 transitions. [2025-03-03 16:18:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:18:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 16:18:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:40,341 INFO L225 Difference]: With dead ends: 6315 [2025-03-03 16:18:40,341 INFO L226 Difference]: Without dead ends: 6313 [2025-03-03 16:18:40,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:18:40,344 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 9587 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11187 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:40,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11187 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6313 states. [2025-03-03 16:18:40,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6313 to 6313. [2025-03-03 16:18:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6313 states, 6311 states have (on average 1.340358104896213) internal successors, (8459), 6312 states have internal predecessors, (8459), 0 states have call successors, (0), 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-03 16:18:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6313 states to 6313 states and 8459 transitions. [2025-03-03 16:18:40,416 INFO L78 Accepts]: Start accepts. Automaton has 6313 states and 8459 transitions. Word has length 93 [2025-03-03 16:18:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:40,416 INFO L471 AbstractCegarLoop]: Abstraction has 6313 states and 8459 transitions. [2025-03-03 16:18:40,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 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-03 16:18:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6313 states and 8459 transitions. [2025-03-03 16:18:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:40,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:40,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:18:40,418 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:40,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1237211028, now seen corresponding path program 1 times [2025-03-03 16:18:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:40,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484315014] [2025-03-03 16:18:40,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:40,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:40,483 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-03 16:18:40,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484315014] [2025-03-03 16:18:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484315014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:40,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:40,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:40,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078702958] [2025-03-03 16:18:40,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:40,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:40,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:40,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:40,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:40,484 INFO L87 Difference]: Start difference. First operand 6313 states and 8459 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:40,514 INFO L93 Difference]: Finished difference Result 6767 states and 9171 transitions. [2025-03-03 16:18:40,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:40,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:40,525 INFO L225 Difference]: With dead ends: 6767 [2025-03-03 16:18:40,525 INFO L226 Difference]: Without dead ends: 6532 [2025-03-03 16:18:40,527 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-03 16:18:40,527 INFO L435 NwaCegarLoop]: 1683 mSDtfsCounter, 1527 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:40,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1788 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6532 states. [2025-03-03 16:18:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6532 to 6530. [2025-03-03 16:18:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6530 states, 6528 states have (on average 1.3474264705882353) internal successors, (8796), 6529 states have internal predecessors, (8796), 0 states have call successors, (0), 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-03 16:18:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6530 states to 6530 states and 8796 transitions. [2025-03-03 16:18:40,603 INFO L78 Accepts]: Start accepts. Automaton has 6530 states and 8796 transitions. Word has length 94 [2025-03-03 16:18:40,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:40,603 INFO L471 AbstractCegarLoop]: Abstraction has 6530 states and 8796 transitions. [2025-03-03 16:18:40,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6530 states and 8796 transitions. [2025-03-03 16:18:40,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:40,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:40,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:18:40,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:40,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 738196780, now seen corresponding path program 1 times [2025-03-03 16:18:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363465018] [2025-03-03 16:18:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:40,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:40,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:40,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:40,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:40,679 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-03 16:18:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:40,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363465018] [2025-03-03 16:18:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363465018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:40,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:40,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:40,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699431115] [2025-03-03 16:18:40,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:40,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:40,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:40,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:40,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:40,680 INFO L87 Difference]: Start difference. First operand 6530 states and 8796 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:40,714 INFO L93 Difference]: Finished difference Result 7402 states and 10154 transitions. [2025-03-03 16:18:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:40,724 INFO L225 Difference]: With dead ends: 7402 [2025-03-03 16:18:40,725 INFO L226 Difference]: Without dead ends: 6950 [2025-03-03 16:18:40,727 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-03 16:18:40,728 INFO L435 NwaCegarLoop]: 1681 mSDtfsCounter, 1525 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1525 SdHoareTripleChecker+Valid, 1790 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:40,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1525 Valid, 1790 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6950 states. [2025-03-03 16:18:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6950 to 6948. [2025-03-03 16:18:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6948 states, 6946 states have (on average 1.3587676360495249) internal successors, (9438), 6947 states have internal predecessors, (9438), 0 states have call successors, (0), 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-03 16:18:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6948 states to 6948 states and 9438 transitions. [2025-03-03 16:18:40,814 INFO L78 Accepts]: Start accepts. Automaton has 6948 states and 9438 transitions. Word has length 94 [2025-03-03 16:18:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:40,814 INFO L471 AbstractCegarLoop]: Abstraction has 6948 states and 9438 transitions. [2025-03-03 16:18:40,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 6948 states and 9438 transitions. [2025-03-03 16:18:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:40,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:40,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:40,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:18:40,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:40,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 583827948, now seen corresponding path program 1 times [2025-03-03 16:18:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553578427] [2025-03-03 16:18:40,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:40,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:40,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:40,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:40,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:40,882 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-03 16:18:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553578427] [2025-03-03 16:18:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553578427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340586882] [2025-03-03 16:18:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:40,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:40,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:40,912 INFO L87 Difference]: Start difference. First operand 6948 states and 9438 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:40,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:40,958 INFO L93 Difference]: Finished difference Result 8624 states and 12024 transitions. [2025-03-03 16:18:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:40,972 INFO L225 Difference]: With dead ends: 8624 [2025-03-03 16:18:40,972 INFO L226 Difference]: Without dead ends: 7754 [2025-03-03 16:18:40,975 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-03 16:18:40,976 INFO L435 NwaCegarLoop]: 1679 mSDtfsCounter, 1523 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:40,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1792 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7754 states. [2025-03-03 16:18:41,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7754 to 7752. [2025-03-03 16:18:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7752 states, 7750 states have (on average 1.375225806451613) internal successors, (10658), 7751 states have internal predecessors, (10658), 0 states have call successors, (0), 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-03 16:18:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7752 states to 7752 states and 10658 transitions. [2025-03-03 16:18:41,102 INFO L78 Accepts]: Start accepts. Automaton has 7752 states and 10658 transitions. Word has length 94 [2025-03-03 16:18:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:41,102 INFO L471 AbstractCegarLoop]: Abstraction has 7752 states and 10658 transitions. [2025-03-03 16:18:41,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 7752 states and 10658 transitions. [2025-03-03 16:18:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:41,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:41,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:41,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:18:41,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:41,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:41,104 INFO L85 PathProgramCache]: Analyzing trace with hash -395102548, now seen corresponding path program 1 times [2025-03-03 16:18:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090124600] [2025-03-03 16:18:41,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:41,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:41,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:41,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:41,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:41,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:41,181 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-03 16:18:41,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:41,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090124600] [2025-03-03 16:18:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090124600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:41,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647086912] [2025-03-03 16:18:41,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:41,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:41,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:41,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:41,183 INFO L87 Difference]: Start difference. First operand 7752 states and 10658 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:41,253 INFO L93 Difference]: Finished difference Result 10972 states and 15572 transitions. [2025-03-03 16:18:41,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:41,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:41,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:41,270 INFO L225 Difference]: With dead ends: 10972 [2025-03-03 16:18:41,270 INFO L226 Difference]: Without dead ends: 9298 [2025-03-03 16:18:41,275 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-03 16:18:41,275 INFO L435 NwaCegarLoop]: 1677 mSDtfsCounter, 1521 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:41,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1794 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9298 states. [2025-03-03 16:18:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9298 to 9296. [2025-03-03 16:18:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9296 states, 9294 states have (on average 1.3955239939746074) internal successors, (12970), 9295 states have internal predecessors, (12970), 0 states have call successors, (0), 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-03 16:18:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9296 states to 9296 states and 12970 transitions. [2025-03-03 16:18:41,434 INFO L78 Accepts]: Start accepts. Automaton has 9296 states and 12970 transitions. Word has length 94 [2025-03-03 16:18:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:41,434 INFO L471 AbstractCegarLoop]: Abstraction has 9296 states and 12970 transitions. [2025-03-03 16:18:41,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9296 states and 12970 transitions. [2025-03-03 16:18:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:41,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:41,435 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:41,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:18:41,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:41,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:41,435 INFO L85 PathProgramCache]: Analyzing trace with hash -843048084, now seen corresponding path program 1 times [2025-03-03 16:18:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:41,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171299006] [2025-03-03 16:18:41,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:41,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:41,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:41,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:41,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:41,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:41,497 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-03 16:18:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:41,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171299006] [2025-03-03 16:18:41,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171299006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:41,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:41,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:41,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131862368] [2025-03-03 16:18:41,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:41,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:41,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:41,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:41,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:41,499 INFO L87 Difference]: Start difference. First operand 9296 states and 12970 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:41,575 INFO L93 Difference]: Finished difference Result 15476 states and 22284 transitions. [2025-03-03 16:18:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:41,596 INFO L225 Difference]: With dead ends: 15476 [2025-03-03 16:18:41,596 INFO L226 Difference]: Without dead ends: 12258 [2025-03-03 16:18:41,602 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-03 16:18:41,603 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 1519 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:41,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1519 Valid, 1796 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:41,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2025-03-03 16:18:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 12256. [2025-03-03 16:18:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12256 states, 12254 states have (on average 1.4148849355312552) internal successors, (17338), 12255 states have internal predecessors, (17338), 0 states have call successors, (0), 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-03 16:18:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12256 states to 12256 states and 17338 transitions. [2025-03-03 16:18:41,750 INFO L78 Accepts]: Start accepts. Automaton has 12256 states and 17338 transitions. Word has length 94 [2025-03-03 16:18:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:41,750 INFO L471 AbstractCegarLoop]: Abstraction has 12256 states and 17338 transitions. [2025-03-03 16:18:41,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 17338 transitions. [2025-03-03 16:18:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:41,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:41,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:41,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:18:41,751 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash -427872212, now seen corresponding path program 1 times [2025-03-03 16:18:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105989680] [2025-03-03 16:18:41,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:41,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:41,809 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-03 16:18:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105989680] [2025-03-03 16:18:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105989680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:41,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190047911] [2025-03-03 16:18:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:41,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:41,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:41,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:41,811 INFO L87 Difference]: Start difference. First operand 12256 states and 17338 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:41,970 INFO L93 Difference]: Finished difference Result 24100 states and 34940 transitions. [2025-03-03 16:18:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:41,998 INFO L225 Difference]: With dead ends: 24100 [2025-03-03 16:18:41,999 INFO L226 Difference]: Without dead ends: 17922 [2025-03-03 16:18:42,006 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-03 16:18:42,007 INFO L435 NwaCegarLoop]: 1673 mSDtfsCounter, 1517 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:42,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1798 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:42,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17922 states. [2025-03-03 16:18:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17922 to 17920. [2025-03-03 16:18:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17920 states, 17918 states have (on average 1.4266101127357964) internal successors, (25562), 17919 states have internal predecessors, (25562), 0 states have call successors, (0), 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-03 16:18:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17920 states to 17920 states and 25562 transitions. [2025-03-03 16:18:42,233 INFO L78 Accepts]: Start accepts. Automaton has 17920 states and 25562 transitions. Word has length 94 [2025-03-03 16:18:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:42,234 INFO L471 AbstractCegarLoop]: Abstraction has 17920 states and 25562 transitions. [2025-03-03 16:18:42,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 17920 states and 25562 transitions. [2025-03-03 16:18:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 16:18:42,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:42,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:18:42,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:42,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:42,235 INFO L85 PathProgramCache]: Analyzing trace with hash -914590484, now seen corresponding path program 1 times [2025-03-03 16:18:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:42,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039363416] [2025-03-03 16:18:42,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:42,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 16:18:42,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 16:18:42,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:42,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:42,299 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-03 16:18:42,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:42,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039363416] [2025-03-03 16:18:42,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039363416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:42,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:42,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:42,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461014208] [2025-03-03 16:18:42,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:42,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:42,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:42,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:42,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:42,301 INFO L87 Difference]: Start difference. First operand 17920 states and 25562 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:42,507 INFO L93 Difference]: Finished difference Result 40580 states and 58716 transitions. [2025-03-03 16:18:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-03-03 16:18:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:42,560 INFO L225 Difference]: With dead ends: 40580 [2025-03-03 16:18:42,560 INFO L226 Difference]: Without dead ends: 28738 [2025-03-03 16:18:42,577 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-03 16:18:42,579 INFO L435 NwaCegarLoop]: 1671 mSDtfsCounter, 1515 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:42,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1800 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28738 states. [2025-03-03 16:18:43,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28738 to 28736. [2025-03-03 16:18:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28736 states, 28734 states have (on average 1.4263938191689287) internal successors, (40986), 28735 states have internal predecessors, (40986), 0 states have call successors, (0), 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-03 16:18:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28736 states to 28736 states and 40986 transitions. [2025-03-03 16:18:43,140 INFO L78 Accepts]: Start accepts. Automaton has 28736 states and 40986 transitions. Word has length 94 [2025-03-03 16:18:43,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:43,141 INFO L471 AbstractCegarLoop]: Abstraction has 28736 states and 40986 transitions. [2025-03-03 16:18:43,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:43,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28736 states and 40986 transitions. [2025-03-03 16:18:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 16:18:43,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:43,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 16:18:43,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:18:43,142 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:43,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1402367564, now seen corresponding path program 1 times [2025-03-03 16:18:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354325562] [2025-03-03 16:18:43,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:43,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:43,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 16:18:43,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 16:18:43,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:43,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:43,216 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-03 16:18:43,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:43,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354325562] [2025-03-03 16:18:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354325562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598995716] [2025-03-03 16:18:43,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:43,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:18:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:43,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:18:43,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:18:43,218 INFO L87 Difference]: Start difference. First operand 28736 states and 40986 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:43,605 INFO L93 Difference]: Finished difference Result 52295 states and 75552 transitions. [2025-03-03 16:18:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:18:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-03-03 16:18:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:43,676 INFO L225 Difference]: With dead ends: 52295 [2025-03-03 16:18:43,676 INFO L226 Difference]: Without dead ends: 39748 [2025-03-03 16:18:43,695 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-03 16:18:43,696 INFO L435 NwaCegarLoop]: 1688 mSDtfsCounter, 1526 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:43,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1789 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:18:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39748 states. [2025-03-03 16:18:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39748 to 39746. [2025-03-03 16:18:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39746 states, 39744 states have (on average 1.4274355877616747) internal successors, (56732), 39745 states have internal predecessors, (56732), 0 states have call successors, (0), 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-03 16:18:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39746 states to 39746 states and 56732 transitions. [2025-03-03 16:18:44,492 INFO L78 Accepts]: Start accepts. Automaton has 39746 states and 56732 transitions. Word has length 96 [2025-03-03 16:18:44,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:44,493 INFO L471 AbstractCegarLoop]: Abstraction has 39746 states and 56732 transitions. [2025-03-03 16:18:44,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:18:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39746 states and 56732 transitions. [2025-03-03 16:18:44,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:18:44,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:44,494 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:18:44,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:18:44,495 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:44,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash -650407708, now seen corresponding path program 1 times [2025-03-03 16:18:44,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:44,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242102243] [2025-03-03 16:18:44,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:44,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:18:44,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:18:44,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:44,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:18:44,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:44,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242102243] [2025-03-03 16:18:44,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242102243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:44,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:44,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:18:44,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143142156] [2025-03-03 16:18:44,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:44,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 16:18:44,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:44,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 16:18:44,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 16:18:44,696 INFO L87 Difference]: Start difference. First operand 39746 states and 56732 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03 16:18:47,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:47,446 INFO L93 Difference]: Finished difference Result 46507 states and 65587 transitions. [2025-03-03 16:18:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 16:18:47,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-03 16:18:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:47,521 INFO L225 Difference]: With dead ends: 46507 [2025-03-03 16:18:47,521 INFO L226 Difference]: Without dead ends: 40497 [2025-03-03 16:18:47,539 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-03 16:18:47,540 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 1051 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1503 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:47,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1503 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 16:18:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40497 states. [2025-03-03 16:18:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40497 to 40497. [2025-03-03 16:18:48,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40497 states, 40495 states have (on average 1.4196567477466353) internal successors, (57489), 40496 states have internal predecessors, (57489), 0 states have call successors, (0), 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-03 16:18:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40497 states to 40497 states and 57489 transitions. [2025-03-03 16:18:48,383 INFO L78 Accepts]: Start accepts. Automaton has 40497 states and 57489 transitions. Word has length 97 [2025-03-03 16:18:48,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:48,383 INFO L471 AbstractCegarLoop]: Abstraction has 40497 states and 57489 transitions. [2025-03-03 16:18:48,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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-03 16:18:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 40497 states and 57489 transitions. [2025-03-03 16:18:48,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:18:48,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:48,389 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:18:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:18:48,390 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:48,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash -272471965, now seen corresponding path program 1 times [2025-03-03 16:18:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954382760] [2025-03-03 16:18:48,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:48,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:18:48,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:18:48,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:48,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:18:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954382760] [2025-03-03 16:18:48,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954382760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:48,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:48,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:18:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207076064] [2025-03-03 16:18:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:18:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:48,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:18:48,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:18:48,591 INFO L87 Difference]: Start difference. First operand 40497 states and 57489 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-03 16:18:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:18:51,975 INFO L93 Difference]: Finished difference Result 316611 states and 456090 transitions. [2025-03-03 16:18:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:18:51,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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 119 [2025-03-03 16:18:51,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:18:52,422 INFO L225 Difference]: With dead ends: 316611 [2025-03-03 16:18:52,423 INFO L226 Difference]: Without dead ends: 282945 [2025-03-03 16:18:52,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:18:52,497 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 11669 mSDsluCounter, 3622 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11669 SdHoareTripleChecker+Valid, 5334 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:18:52,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11669 Valid, 5334 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:18:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282945 states. [2025-03-03 16:18:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282945 to 74161. [2025-03-03 16:18:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74161 states, 74159 states have (on average 1.4259226796477837) internal successors, (105745), 74160 states have internal predecessors, (105745), 0 states have call successors, (0), 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-03 16:18:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74161 states to 74161 states and 105745 transitions. [2025-03-03 16:18:55,833 INFO L78 Accepts]: Start accepts. Automaton has 74161 states and 105745 transitions. Word has length 119 [2025-03-03 16:18:55,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:18:55,834 INFO L471 AbstractCegarLoop]: Abstraction has 74161 states and 105745 transitions. [2025-03-03 16:18:55,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 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-03 16:18:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74161 states and 105745 transitions. [2025-03-03 16:18:55,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:18:55,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:18:55,842 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:18:55,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:18:55,843 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:18:55,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:18:55,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1702935843, now seen corresponding path program 1 times [2025-03-03 16:18:55,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:18:55,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932859308] [2025-03-03 16:18:55,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:18:55,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:18:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:18:55,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:18:55,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:18:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:18:56,049 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:18:56,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:18:56,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932859308] [2025-03-03 16:18:56,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932859308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:18:56,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:18:56,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:18:56,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616116290] [2025-03-03 16:18:56,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:18:56,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:18:56,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:18:56,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:18:56,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:18:56,052 INFO L87 Difference]: Start difference. First operand 74161 states and 105745 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:19:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:01,254 INFO L93 Difference]: Finished difference Result 350275 states and 504346 transitions. [2025-03-03 16:19:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:19:01,254 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2025-03-03 16:19:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:01,779 INFO L225 Difference]: With dead ends: 350275 [2025-03-03 16:19:01,779 INFO L226 Difference]: Without dead ends: 316609 [2025-03-03 16:19:01,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:19:01,864 INFO L435 NwaCegarLoop]: 1709 mSDtfsCounter, 11694 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11694 SdHoareTripleChecker+Valid, 5167 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:01,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11694 Valid, 5167 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316609 states. [2025-03-03 16:19:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316609 to 124721. [2025-03-03 16:19:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124721 states, 124719 states have (on average 1.4256769217200267) internal successors, (177809), 124720 states have internal predecessors, (177809), 0 states have call successors, (0), 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-03 16:19:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124721 states to 124721 states and 177809 transitions. [2025-03-03 16:19:05,736 INFO L78 Accepts]: Start accepts. Automaton has 124721 states and 177809 transitions. Word has length 119 [2025-03-03 16:19:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:19:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 124721 states and 177809 transitions. [2025-03-03 16:19:05,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:19:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 124721 states and 177809 transitions. [2025-03-03 16:19:05,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 16:19:05,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:19:05,745 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:19:05,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:19:05,745 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:19:05,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:19:05,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1548567011, now seen corresponding path program 1 times [2025-03-03 16:19:05,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:19:05,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509898621] [2025-03-03 16:19:05,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:19:05,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:19:05,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 16:19:05,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 16:19:05,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:19:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:19:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:19:06,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:19:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509898621] [2025-03-03 16:19:06,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509898621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:19:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:19:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 16:19:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711609154] [2025-03-03 16:19:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:19:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 16:19:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:19:06,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 16:19:06,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 16:19:06,223 INFO L87 Difference]: Start difference. First operand 124721 states and 177809 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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-03 16:19:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:19:12,149 INFO L93 Difference]: Finished difference Result 383939 states and 552602 transitions. [2025-03-03 16:19:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 16:19:12,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 119 [2025-03-03 16:19:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:19:12,713 INFO L225 Difference]: With dead ends: 383939 [2025-03-03 16:19:12,713 INFO L226 Difference]: Without dead ends: 350273 [2025-03-03 16:19:12,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:19:12,798 INFO L435 NwaCegarLoop]: 1706 mSDtfsCounter, 11731 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11731 SdHoareTripleChecker+Valid, 5100 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:19:12,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11731 Valid, 5100 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:19:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350273 states.