./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.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 a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:29:03,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:29:03,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:29:03,291 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:29:03,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:29:03,313 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:29:03,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:29:03,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:29:03,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:29:03,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:29:03,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:29:03,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:29:03,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:29:03,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:29:03,316 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:29:03,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:29:03,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:29:03,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:29:03,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:29:03,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:29:03,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:29:03,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:29:03,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:29:03,318 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 -> a36bffe61006645fe9b7956abb35417c0319419001c91f9dd38ab2cdcd2c159e [2025-03-08 07:29:03,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:29:03,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:29:03,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:29:03,554 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:29:03,555 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:29:03,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:29:04,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3acc58f/cb2f7e8a55744526803da04b7c99a9a4/FLAG427abd6cd [2025-03-08 07:29:05,160 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:29:05,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:29:05,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3acc58f/cb2f7e8a55744526803da04b7c99a9a4/FLAG427abd6cd [2025-03-08 07:29:05,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f3acc58f/cb2f7e8a55744526803da04b7c99a9a4 [2025-03-08 07:29:05,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:29:05,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:29:05,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:29:05,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:29:05,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:29:05,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:29:05" (1/1) ... [2025-03-08 07:29:05,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f121fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:05, skipping insertion in model container [2025-03-08 07:29:05,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:29:05" (1/1) ... [2025-03-08 07:29:05,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:29:05,681 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.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2025-03-08 07:29:05,728 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.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2025-03-08 07:29:06,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:29:06,144 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:29:06,192 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.1.ufo.UNBOUNDED.pals+Problem12_label05.c[26925,26938] [2025-03-08 07:29:06,205 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.1.ufo.UNBOUNDED.pals+Problem12_label05.c[33861,33874] [2025-03-08 07:29:06,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:29:06,460 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:29:06,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06 WrapperNode [2025-03-08 07:29:06,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:29:06,462 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:29:06,462 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:29:06,462 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:29:06,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,749 INFO L138 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5286 [2025-03-08 07:29:06,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:29:06,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:29:06,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:29:06,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:29:06,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 07:29:06,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:06,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:29:07,214 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:29:07,215 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:29:07,215 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:29:07,216 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (1/1) ... [2025-03-08 07:29:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:29:07,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:29:07,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 07:29:07,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 07:29:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:29:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:29:07,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:29:07,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:29:07,383 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:29:07,385 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:29:10,659 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2377: havoc calculate_output_#t~ret49#1; [2025-03-08 07:29:10,660 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3856: havoc calculate_output2_#t~ret50#1; [2025-03-08 07:29:10,660 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5346: havoc calculate_output3_#t~ret51#1; [2025-03-08 07:29:10,823 INFO L? ?]: Removed 759 outVars from TransFormulas that were not future-live. [2025-03-08 07:29:10,823 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:29:10,855 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:29:10,858 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:29:10,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:29:10 BoogieIcfgContainer [2025-03-08 07:29:10,858 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:29:10,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:29:10,860 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:29:10,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:29:10,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:29:05" (1/3) ... [2025-03-08 07:29:10,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f13c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:29:10, skipping insertion in model container [2025-03-08 07:29:10,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:29:06" (2/3) ... [2025-03-08 07:29:10,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7f13c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:29:10, skipping insertion in model container [2025-03-08 07:29:10,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:29:10" (3/3) ... [2025-03-08 07:29:10,866 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-08 07:29:10,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:29:10,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.8.1.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 948 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:29:10,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:29:10,952 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;@7e496740, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:29:10,952 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:29:10,959 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-08 07:29:10,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 07:29:10,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:10,964 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-08 07:29:10,964 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:10,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash 56877933, now seen corresponding path program 1 times [2025-03-08 07:29:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196704393] [2025-03-08 07:29:10,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 07:29:11,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 07:29:11,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:11,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:11,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-08 07:29:11,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:11,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196704393] [2025-03-08 07:29:11,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196704393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:11,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:11,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:29:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839103904] [2025-03-08 07:29:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:29:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:11,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:29:11,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:29:11,243 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 2 states, 2 states have (on average 15.0) internal successors, (30), 2 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-08 07:29:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:11,304 INFO L93 Difference]: Finished difference Result 1828 states and 3463 transitions. [2025-03-08 07:29:11,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:29:11,306 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 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-08 07:29:11,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:11,321 INFO L225 Difference]: With dead ends: 1828 [2025-03-08 07:29:11,321 INFO L226 Difference]: Without dead ends: 883 [2025-03-08 07:29:11,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:29:11,329 INFO L435 NwaCegarLoop]: 1731 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:29:11,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:29:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-08 07:29:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-08 07:29:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8921679909194098) internal successors, (1667), 882 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1667 transitions. [2025-03-08 07:29:11,407 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1667 transitions. Word has length 30 [2025-03-08 07:29:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:11,407 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1667 transitions. [2025-03-08 07:29:11,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 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-08 07:29:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1667 transitions. [2025-03-08 07:29:11,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 07:29:11,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:11,410 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-08 07:29:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:29:11,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -10128820, now seen corresponding path program 1 times [2025-03-08 07:29:11,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:11,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887174592] [2025-03-08 07:29:11,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:11,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 07:29:11,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 07:29:11,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:11,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:11,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887174592] [2025-03-08 07:29:11,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887174592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:11,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:11,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:29:11,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601136123] [2025-03-08 07:29:11,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:11,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:29:11,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:11,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:29:11,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:29:11,677 INFO L87 Difference]: Start difference. First operand 883 states and 1667 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-08 07:29:11,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:11,795 INFO L93 Difference]: Finished difference Result 949 states and 1771 transitions. [2025-03-08 07:29:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:29:11,795 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-08 07:29:11,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:11,799 INFO L225 Difference]: With dead ends: 949 [2025-03-08 07:29:11,799 INFO L226 Difference]: Without dead ends: 883 [2025-03-08 07:29:11,800 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-08 07:29:11,800 INFO L435 NwaCegarLoop]: 1665 mSDtfsCounter, 0 mSDsluCounter, 4929 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:29:11,800 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.1s Time] [2025-03-08 07:29:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-08 07:29:11,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2025-03-08 07:29:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 881 states have (on average 1.8229284903518728) internal successors, (1606), 882 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1606 transitions. [2025-03-08 07:29:11,823 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1606 transitions. Word has length 30 [2025-03-08 07:29:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:11,823 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1606 transitions. [2025-03-08 07:29:11,823 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-08 07:29:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1606 transitions. [2025-03-08 07:29:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 07:29:11,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:11,824 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] [2025-03-08 07:29:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:29:11,825 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:11,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:11,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1623297802, now seen corresponding path program 1 times [2025-03-08 07:29:11,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:11,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907691052] [2025-03-08 07:29:11,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:11,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 07:29:11,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 07:29:11,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:11,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:12,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:12,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:12,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907691052] [2025-03-08 07:29:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907691052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:12,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852982243] [2025-03-08 07:29:12,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:12,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:29:12,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:12,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:29:12,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:29:12,101 INFO L87 Difference]: Start difference. First operand 883 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:16,888 INFO L93 Difference]: Finished difference Result 3138 states and 5915 transitions. [2025-03-08 07:29:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:29:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-08 07:29:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:16,897 INFO L225 Difference]: With dead ends: 3138 [2025-03-08 07:29:16,898 INFO L226 Difference]: Without dead ends: 2385 [2025-03-08 07:29:16,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:29:16,902 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 2515 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-08 07:29:16,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 878 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-08 07:29:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2025-03-08 07:29:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2385. [2025-03-08 07:29:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2385 states, 2383 states have (on average 1.566093159882501) internal successors, (3732), 2384 states have internal predecessors, (3732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2385 states to 2385 states and 3732 transitions. [2025-03-08 07:29:16,961 INFO L78 Accepts]: Start accepts. Automaton has 2385 states and 3732 transitions. Word has length 60 [2025-03-08 07:29:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:16,961 INFO L471 AbstractCegarLoop]: Abstraction has 2385 states and 3732 transitions. [2025-03-08 07:29:16,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:16,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2385 states and 3732 transitions. [2025-03-08 07:29:16,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 07:29:16,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:16,965 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-08 07:29:16,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:29:16,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:16,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:16,966 INFO L85 PathProgramCache]: Analyzing trace with hash -551956336, now seen corresponding path program 1 times [2025-03-08 07:29:16,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:16,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154957598] [2025-03-08 07:29:16,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:16,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:16,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 07:29:17,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 07:29:17,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:17,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154957598] [2025-03-08 07:29:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154957598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 07:29:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104352740] [2025-03-08 07:29:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:29:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:17,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:29:17,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:29:17,285 INFO L87 Difference]: Start difference. First operand 2385 states and 3732 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-08 07:29:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:17,682 INFO L93 Difference]: Finished difference Result 3377 states and 5332 transitions. [2025-03-08 07:29:17,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 07:29:17,682 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-08 07:29:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:17,695 INFO L225 Difference]: With dead ends: 3377 [2025-03-08 07:29:17,695 INFO L226 Difference]: Without dead ends: 3315 [2025-03-08 07:29:17,697 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-08 07:29:17,699 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-08 07:29:17,699 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-08 07:29:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3315 states. [2025-03-08 07:29:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3315 to 2445. [2025-03-08 07:29:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2443 states have (on average 1.5673352435530086) internal successors, (3829), 2444 states have internal predecessors, (3829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3829 transitions. [2025-03-08 07:29:17,750 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3829 transitions. Word has length 90 [2025-03-08 07:29:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:17,751 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3829 transitions. [2025-03-08 07:29:17,751 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-08 07:29:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3829 transitions. [2025-03-08 07:29:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 07:29:17,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:17,753 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-08 07:29:17,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:29:17,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1028708245, now seen corresponding path program 1 times [2025-03-08 07:29:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622631409] [2025-03-08 07:29:17,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:17,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:29:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:29:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622631409] [2025-03-08 07:29:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622631409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:17,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:17,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:17,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126028887] [2025-03-08 07:29:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:17,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:17,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:17,864 INFO L87 Difference]: Start difference. First operand 2445 states and 3829 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-08 07:29:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:17,898 INFO L93 Difference]: Finished difference Result 2678 states and 4204 transitions. [2025-03-08 07:29:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:17,898 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-08 07:29:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:17,906 INFO L225 Difference]: With dead ends: 2678 [2025-03-08 07:29:17,906 INFO L226 Difference]: Without dead ends: 2556 [2025-03-08 07:29:17,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:17,907 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-08 07:29:17,907 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-08 07:29:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2025-03-08 07:29:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2552. [2025-03-08 07:29:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.568235294117647) internal successors, (3999), 2551 states have internal predecessors, (3999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3999 transitions. [2025-03-08 07:29:17,953 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3999 transitions. Word has length 92 [2025-03-08 07:29:17,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:17,954 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3999 transitions. [2025-03-08 07:29:17,954 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-08 07:29:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3999 transitions. [2025-03-08 07:29:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 07:29:17,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:17,955 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-08 07:29:17,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:29:17,955 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash -996385010, now seen corresponding path program 1 times [2025-03-08 07:29:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492990898] [2025-03-08 07:29:17,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:17,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 07:29:17,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 07:29:17,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492990898] [2025-03-08 07:29:18,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492990898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:18,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:18,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 07:29:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077821213] [2025-03-08 07:29:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:18,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:29:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:18,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:29:18,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:29:18,353 INFO L87 Difference]: Start difference. First operand 2552 states and 3999 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-08 07:29:18,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:18,679 INFO L93 Difference]: Finished difference Result 2783 states and 4367 transitions. [2025-03-08 07:29:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:29:18,679 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-08 07:29:18,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:18,687 INFO L225 Difference]: With dead ends: 2783 [2025-03-08 07:29:18,687 INFO L226 Difference]: Without dead ends: 2554 [2025-03-08 07:29:18,688 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-08 07:29:18,688 INFO L435 NwaCegarLoop]: 1597 mSDtfsCounter, 3102 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3102 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:29:18,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3102 Valid, 2279 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:29:18,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2025-03-08 07:29:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2552. [2025-03-08 07:29:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5674509803921568) internal successors, (3997), 2551 states have internal predecessors, (3997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3997 transitions. [2025-03-08 07:29:18,729 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3997 transitions. Word has length 92 [2025-03-08 07:29:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:18,729 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3997 transitions. [2025-03-08 07:29:18,729 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-08 07:29:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3997 transitions. [2025-03-08 07:29:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 07:29:18,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:18,731 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-08 07:29:18,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:29:18,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:18,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:18,731 INFO L85 PathProgramCache]: Analyzing trace with hash -792626504, now seen corresponding path program 1 times [2025-03-08 07:29:18,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:18,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371443729] [2025-03-08 07:29:18,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:18,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:18,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 07:29:18,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 07:29:18,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:18,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:19,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371443729] [2025-03-08 07:29:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371443729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:29:19,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60697653] [2025-03-08 07:29:19,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:29:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:19,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:29:19,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:29:19,047 INFO L87 Difference]: Start difference. First operand 2552 states and 3997 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-08 07:29:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:19,095 INFO L93 Difference]: Finished difference Result 2560 states and 4006 transitions. [2025-03-08 07:29:19,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:29:19,095 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-08 07:29:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:19,102 INFO L225 Difference]: With dead ends: 2560 [2025-03-08 07:29:19,103 INFO L226 Difference]: Without dead ends: 2558 [2025-03-08 07:29:19,103 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-08 07:29:19,104 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-08 07:29:19,104 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-08 07:29:19,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-03-08 07:29:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2025-03-08 07:29:19,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.5657276995305165) internal successors, (4002), 2557 states have internal predecessors, (4002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:19,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4002 transitions. [2025-03-08 07:29:19,145 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4002 transitions. Word has length 93 [2025-03-08 07:29:19,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:19,145 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4002 transitions. [2025-03-08 07:29:19,145 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-08 07:29:19,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4002 transitions. [2025-03-08 07:29:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:19,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:19,146 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-08 07:29:19,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:29:19,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:19,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1237211028, now seen corresponding path program 1 times [2025-03-08 07:29:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:19,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411358966] [2025-03-08 07:29:19,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:19,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:19,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:19,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:19,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411358966] [2025-03-08 07:29:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411358966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671539015] [2025-03-08 07:29:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:19,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:19,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:19,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:19,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,213 INFO L87 Difference]: Start difference. First operand 2558 states and 4002 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-08 07:29:19,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:19,239 INFO L93 Difference]: Finished difference Result 3012 states and 4714 transitions. [2025-03-08 07:29:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:19,239 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-08 07:29:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:19,247 INFO L225 Difference]: With dead ends: 3012 [2025-03-08 07:29:19,247 INFO L226 Difference]: Without dead ends: 2777 [2025-03-08 07:29:19,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,249 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-08 07:29:19,249 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-08 07:29:19,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2025-03-08 07:29:19,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2775. [2025-03-08 07:29:19,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2773 states have (on average 1.56473133790119) internal successors, (4339), 2774 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 4339 transitions. [2025-03-08 07:29:19,290 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 4339 transitions. Word has length 94 [2025-03-08 07:29:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:19,291 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 4339 transitions. [2025-03-08 07:29:19,291 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-08 07:29:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 4339 transitions. [2025-03-08 07:29:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:19,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:19,292 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-08 07:29:19,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:29:19,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash 738196780, now seen corresponding path program 1 times [2025-03-08 07:29:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:19,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208439725] [2025-03-08 07:29:19,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:19,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:19,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:19,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:19,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:19,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:19,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:19,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208439725] [2025-03-08 07:29:19,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208439725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:19,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:19,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:19,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242484035] [2025-03-08 07:29:19,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:19,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:19,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:19,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:19,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,355 INFO L87 Difference]: Start difference. First operand 2775 states and 4339 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-08 07:29:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:19,385 INFO L93 Difference]: Finished difference Result 3647 states and 5697 transitions. [2025-03-08 07:29:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:19,385 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-08 07:29:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:19,394 INFO L225 Difference]: With dead ends: 3647 [2025-03-08 07:29:19,394 INFO L226 Difference]: Without dead ends: 3195 [2025-03-08 07:29:19,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,396 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-08 07:29:19,396 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-08 07:29:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2025-03-08 07:29:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 3193. [2025-03-08 07:29:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3191 states have (on average 1.560952679410843) internal successors, (4981), 3192 states have internal predecessors, (4981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:19,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4981 transitions. [2025-03-08 07:29:19,451 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4981 transitions. Word has length 94 [2025-03-08 07:29:19,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:19,452 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4981 transitions. [2025-03-08 07:29:19,452 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-08 07:29:19,452 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4981 transitions. [2025-03-08 07:29:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:19,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:19,453 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-08 07:29:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:29:19,453 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 583827948, now seen corresponding path program 1 times [2025-03-08 07:29:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296807729] [2025-03-08 07:29:19,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:19,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:19,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:19,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:19,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:19,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296807729] [2025-03-08 07:29:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296807729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:19,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:19,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:19,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925153284] [2025-03-08 07:29:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:19,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:19,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:19,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,515 INFO L87 Difference]: Start difference. First operand 3193 states and 4981 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-08 07:29:19,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:19,548 INFO L93 Difference]: Finished difference Result 4869 states and 7567 transitions. [2025-03-08 07:29:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:19,548 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-08 07:29:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:19,559 INFO L225 Difference]: With dead ends: 4869 [2025-03-08 07:29:19,560 INFO L226 Difference]: Without dead ends: 3999 [2025-03-08 07:29:19,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,562 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-08 07:29:19,563 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-08 07:29:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2025-03-08 07:29:19,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3997. [2025-03-08 07:29:19,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3995 states have (on average 1.5521902377972465) internal successors, (6201), 3996 states have internal predecessors, (6201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6201 transitions. [2025-03-08 07:29:19,641 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6201 transitions. Word has length 94 [2025-03-08 07:29:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:19,641 INFO L471 AbstractCegarLoop]: Abstraction has 3997 states and 6201 transitions. [2025-03-08 07:29:19,641 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-08 07:29:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6201 transitions. [2025-03-08 07:29:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:19,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:19,642 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-08 07:29:19,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:29:19,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:19,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash -395102548, now seen corresponding path program 1 times [2025-03-08 07:29:19,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:19,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102621410] [2025-03-08 07:29:19,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:19,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:19,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:19,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:19,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102621410] [2025-03-08 07:29:19,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102621410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:19,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:19,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:19,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075405351] [2025-03-08 07:29:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:19,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:19,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:19,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:19,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,712 INFO L87 Difference]: Start difference. First operand 3997 states and 6201 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-08 07:29:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:19,767 INFO L93 Difference]: Finished difference Result 7217 states and 11115 transitions. [2025-03-08 07:29:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:19,768 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-08 07:29:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:19,787 INFO L225 Difference]: With dead ends: 7217 [2025-03-08 07:29:19,787 INFO L226 Difference]: Without dead ends: 5543 [2025-03-08 07:29:19,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:19,792 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-08 07:29:19,792 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-08 07:29:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2025-03-08 07:29:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 5541. [2025-03-08 07:29:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 5539 states have (on average 1.5369200216645604) internal successors, (8513), 5540 states have internal predecessors, (8513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:19,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 8513 transitions. [2025-03-08 07:29:19,945 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 8513 transitions. Word has length 94 [2025-03-08 07:29:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 8513 transitions. [2025-03-08 07:29:19,945 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-08 07:29:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 8513 transitions. [2025-03-08 07:29:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:19,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:19,946 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-08 07:29:19,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:29:19,947 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash -843048084, now seen corresponding path program 1 times [2025-03-08 07:29:19,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:19,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855501998] [2025-03-08 07:29:19,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:19,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:19,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:19,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:19,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:19,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:20,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:20,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855501998] [2025-03-08 07:29:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855501998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:20,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746203000] [2025-03-08 07:29:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:20,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:20,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:20,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:20,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:20,009 INFO L87 Difference]: Start difference. First operand 5541 states and 8513 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-08 07:29:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:20,099 INFO L93 Difference]: Finished difference Result 11721 states and 17827 transitions. [2025-03-08 07:29:20,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:20,099 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-08 07:29:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:20,117 INFO L225 Difference]: With dead ends: 11721 [2025-03-08 07:29:20,118 INFO L226 Difference]: Without dead ends: 8503 [2025-03-08 07:29:20,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:20,125 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-08 07:29:20,125 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-08 07:29:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2025-03-08 07:29:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8501. [2025-03-08 07:29:20,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8499 states have (on average 1.5155900694199318) internal successors, (12881), 8500 states have internal predecessors, (12881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 12881 transitions. [2025-03-08 07:29:20,295 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 12881 transitions. Word has length 94 [2025-03-08 07:29:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:20,295 INFO L471 AbstractCegarLoop]: Abstraction has 8501 states and 12881 transitions. [2025-03-08 07:29:20,296 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-08 07:29:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 12881 transitions. [2025-03-08 07:29:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:20,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:20,297 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-08 07:29:20,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:29:20,297 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:20,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:20,297 INFO L85 PathProgramCache]: Analyzing trace with hash -427872212, now seen corresponding path program 1 times [2025-03-08 07:29:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:20,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703682794] [2025-03-08 07:29:20,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:20,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:20,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:20,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:20,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:20,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:20,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703682794] [2025-03-08 07:29:20,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703682794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:20,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:20,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:20,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756228357] [2025-03-08 07:29:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:20,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:20,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:20,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:20,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:20,366 INFO L87 Difference]: Start difference. First operand 8501 states and 12881 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-08 07:29:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:20,492 INFO L93 Difference]: Finished difference Result 20345 states and 30483 transitions. [2025-03-08 07:29:20,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:20,492 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-08 07:29:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:20,517 INFO L225 Difference]: With dead ends: 20345 [2025-03-08 07:29:20,517 INFO L226 Difference]: Without dead ends: 14167 [2025-03-08 07:29:20,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-08 07:29:20,528 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-08 07:29:20,528 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-08 07:29:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14167 states. [2025-03-08 07:29:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14167 to 14165. [2025-03-08 07:29:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14165 states, 14163 states have (on average 1.49015039186613) internal successors, (21105), 14164 states have internal predecessors, (21105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14165 states to 14165 states and 21105 transitions. [2025-03-08 07:29:20,970 INFO L78 Accepts]: Start accepts. Automaton has 14165 states and 21105 transitions. Word has length 94 [2025-03-08 07:29:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:20,970 INFO L471 AbstractCegarLoop]: Abstraction has 14165 states and 21105 transitions. [2025-03-08 07:29:20,970 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-08 07:29:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 14165 states and 21105 transitions. [2025-03-08 07:29:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 07:29:20,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:20,972 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-08 07:29:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:29:20,972 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash -914590484, now seen corresponding path program 1 times [2025-03-08 07:29:20,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113503302] [2025-03-08 07:29:20,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:20,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 07:29:21,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 07:29:21,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:21,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113503302] [2025-03-08 07:29:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113503302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:21,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976511113] [2025-03-08 07:29:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:21,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:21,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:21,059 INFO L87 Difference]: Start difference. First operand 14165 states and 21105 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-08 07:29:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:21,305 INFO L93 Difference]: Finished difference Result 36825 states and 54259 transitions. [2025-03-08 07:29:21,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:21,305 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-08 07:29:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:21,350 INFO L225 Difference]: With dead ends: 36825 [2025-03-08 07:29:21,350 INFO L226 Difference]: Without dead ends: 24983 [2025-03-08 07:29:21,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:21,370 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-08 07:29:21,370 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-08 07:29:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24983 states. [2025-03-08 07:29:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24983 to 24981. [2025-03-08 07:29:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24981 states, 24979 states have (on average 1.4623884062612595) internal successors, (36529), 24980 states have internal predecessors, (36529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24981 states to 24981 states and 36529 transitions. [2025-03-08 07:29:21,939 INFO L78 Accepts]: Start accepts. Automaton has 24981 states and 36529 transitions. Word has length 94 [2025-03-08 07:29:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:21,940 INFO L471 AbstractCegarLoop]: Abstraction has 24981 states and 36529 transitions. [2025-03-08 07:29:21,940 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-08 07:29:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 24981 states and 36529 transitions. [2025-03-08 07:29:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 07:29:21,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:21,941 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-08 07:29:21,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:29:21,942 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:21,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1402367564, now seen corresponding path program 1 times [2025-03-08 07:29:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:21,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869560810] [2025-03-08 07:29:21,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:21,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 07:29:21,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 07:29:21,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:21,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 07:29:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:22,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869560810] [2025-03-08 07:29:22,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869560810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:22,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:22,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:29:22,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97243694] [2025-03-08 07:29:22,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:22,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:29:22,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:22,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:29:22,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:22,006 INFO L87 Difference]: Start difference. First operand 24981 states and 36529 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-08 07:29:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:22,439 INFO L93 Difference]: Finished difference Result 48540 states and 71095 transitions. [2025-03-08 07:29:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:29:22,440 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-08 07:29:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:22,508 INFO L225 Difference]: With dead ends: 48540 [2025-03-08 07:29:22,508 INFO L226 Difference]: Without dead ends: 35993 [2025-03-08 07:29:22,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:29:22,522 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-08 07:29:22,522 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-08 07:29:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35993 states. [2025-03-08 07:29:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35993 to 35991. [2025-03-08 07:29:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35991 states, 35989 states have (on average 1.4525271610769956) internal successors, (52275), 35990 states have internal predecessors, (52275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35991 states to 35991 states and 52275 transitions. [2025-03-08 07:29:23,251 INFO L78 Accepts]: Start accepts. Automaton has 35991 states and 52275 transitions. Word has length 96 [2025-03-08 07:29:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 35991 states and 52275 transitions. [2025-03-08 07:29:23,252 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-08 07:29:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35991 states and 52275 transitions. [2025-03-08 07:29:23,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 07:29:23,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:23,258 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-08 07:29:23,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:29:23,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:23,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash -272471965, now seen corresponding path program 1 times [2025-03-08 07:29:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:23,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710978719] [2025-03-08 07:29:23,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:23,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 07:29:23,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 07:29:23,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:23,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:23,492 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-08 07:29:23,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:23,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710978719] [2025-03-08 07:29:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710978719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:23,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 07:29:23,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927909482] [2025-03-08 07:29:23,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:23,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:29:23,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:23,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:29:23,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:29:23,494 INFO L87 Difference]: Start difference. First operand 35991 states and 52275 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-08 07:29:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:27,034 INFO L93 Difference]: Finished difference Result 312105 states and 450876 transitions. [2025-03-08 07:29:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:29:27,035 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-08 07:29:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:27,544 INFO L225 Difference]: With dead ends: 312105 [2025-03-08 07:29:27,544 INFO L226 Difference]: Without dead ends: 278439 [2025-03-08 07:29:27,623 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-08 07:29:27,624 INFO L435 NwaCegarLoop]: 1712 mSDtfsCounter, 11665 mSDsluCounter, 3664 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11665 SdHoareTripleChecker+Valid, 5376 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:29:27,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11665 Valid, 5376 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:29:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278439 states. [2025-03-08 07:29:30,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278439 to 69655. [2025-03-08 07:29:30,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69655 states, 69653 states have (on average 1.4433118458644998) internal successors, (100531), 69654 states have internal predecessors, (100531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69655 states to 69655 states and 100531 transitions. [2025-03-08 07:29:31,103 INFO L78 Accepts]: Start accepts. Automaton has 69655 states and 100531 transitions. Word has length 119 [2025-03-08 07:29:31,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:31,104 INFO L471 AbstractCegarLoop]: Abstraction has 69655 states and 100531 transitions. [2025-03-08 07:29:31,104 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-08 07:29:31,104 INFO L276 IsEmpty]: Start isEmpty. Operand 69655 states and 100531 transitions. [2025-03-08 07:29:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 07:29:31,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:31,113 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-08 07:29:31,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:29:31,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:31,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:31,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1702935843, now seen corresponding path program 1 times [2025-03-08 07:29:31,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:31,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502886618] [2025-03-08 07:29:31,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:31,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:31,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 07:29:31,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 07:29:31,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:31,440 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-08 07:29:31,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:31,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502886618] [2025-03-08 07:29:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502886618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:31,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:31,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 07:29:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354634501] [2025-03-08 07:29:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:31,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:29:31,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:31,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:29:31,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:29:31,442 INFO L87 Difference]: Start difference. First operand 69655 states and 100531 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-08 07:29:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:29:36,456 INFO L93 Difference]: Finished difference Result 345769 states and 499132 transitions. [2025-03-08 07:29:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 07:29:36,457 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-08 07:29:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:29:37,075 INFO L225 Difference]: With dead ends: 345769 [2025-03-08 07:29:37,076 INFO L226 Difference]: Without dead ends: 312103 [2025-03-08 07:29:37,176 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-08 07:29:37,177 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-08 07:29:37,177 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-08 07:29:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312103 states. [2025-03-08 07:29:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312103 to 120215. [2025-03-08 07:29:42,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120215 states, 120213 states have (on average 1.4357432224468236) internal successors, (172595), 120214 states have internal predecessors, (172595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:29:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120215 states to 120215 states and 172595 transitions. [2025-03-08 07:29:42,301 INFO L78 Accepts]: Start accepts. Automaton has 120215 states and 172595 transitions. Word has length 119 [2025-03-08 07:29:42,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:29:42,301 INFO L471 AbstractCegarLoop]: Abstraction has 120215 states and 172595 transitions. [2025-03-08 07:29:42,302 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-08 07:29:42,302 INFO L276 IsEmpty]: Start isEmpty. Operand 120215 states and 172595 transitions. [2025-03-08 07:29:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 07:29:42,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:29:42,308 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-08 07:29:42,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:29:42,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:29:42,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:29:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1548567011, now seen corresponding path program 1 times [2025-03-08 07:29:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:29:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363037225] [2025-03-08 07:29:42,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:29:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:29:42,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 07:29:42,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 07:29:42,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:29:42,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:29:42,512 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-08 07:29:42,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:29:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363037225] [2025-03-08 07:29:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363037225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:29:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:29:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 07:29:42,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194459721] [2025-03-08 07:29:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:29:42,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 07:29:42,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:29:42,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 07:29:42,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 07:29:42,513 INFO L87 Difference]: Start difference. First operand 120215 states and 172595 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)