./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.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.7.ufo.UNBOUNDED.pals+Problem12_label08.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 7f21ea595eac4353ca417fd812da6cdd2e6031060e3844060c8f8fe5fbe20b17 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 07:28:06,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 07:28:06,802 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 07:28:06,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 07:28:06,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 07:28:06,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 07:28:06,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 07:28:06,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 07:28:06,823 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 07:28:06,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 07:28:06,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 07:28:06,823 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 07:28:06,824 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 07:28:06,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:28:06,826 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 07:28:06,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 07:28:06,826 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 07:28:06,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 07:28:06,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 07:28:06,827 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 -> 7f21ea595eac4353ca417fd812da6cdd2e6031060e3844060c8f8fe5fbe20b17 [2025-03-08 07:28:07,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 07:28:07,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 07:28:07,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 07:28:07,037 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 07:28:07,037 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 07:28:07,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-03-08 07:28:08,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9143f7277/b66bf6a9da2749139f05f8c91f5d20f8/FLAG6dd1d490e [2025-03-08 07:28:08,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 07:28:08,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-03-08 07:28:08,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9143f7277/b66bf6a9da2749139f05f8c91f5d20f8/FLAG6dd1d490e [2025-03-08 07:28:08,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9143f7277/b66bf6a9da2749139f05f8c91f5d20f8 [2025-03-08 07:28:08,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 07:28:08,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 07:28:08,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 07:28:08,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 07:28:08,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 07:28:08,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:28:08" (1/1) ... [2025-03-08 07:28:08,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21924a89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:08, skipping insertion in model container [2025-03-08 07:28:08,810 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:28:08" (1/1) ... [2025-03-08 07:28:08,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 07:28:09,228 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.7.ufo.UNBOUNDED.pals+Problem12_label08.c[20454,20467] [2025-03-08 07:28:09,264 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.7.ufo.UNBOUNDED.pals+Problem12_label08.c[23961,23974] [2025-03-08 07:28:09,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:28:09,690 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 07:28:09,712 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.7.ufo.UNBOUNDED.pals+Problem12_label08.c[20454,20467] [2025-03-08 07:28:09,715 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.7.ufo.UNBOUNDED.pals+Problem12_label08.c[23961,23974] [2025-03-08 07:28:09,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 07:28:09,974 INFO L204 MainTranslator]: Completed translation [2025-03-08 07:28:09,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09 WrapperNode [2025-03-08 07:28:09,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 07:28:09,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 07:28:09,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 07:28:09,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 07:28:09,981 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:28:09" (1/1) ... [2025-03-08 07:28:10,025 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:28:09" (1/1) ... [2025-03-08 07:28:10,278 INFO L138 Inliner]: procedures = 39, calls = 24, calls flagged for inlining = 19, calls inlined = 19, statements flattened = 5213 [2025-03-08 07:28:10,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 07:28:10,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 07:28:10,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 07:28:10,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 07:28:10,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,466 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:28:10,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 07:28:10,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 07:28:10,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 07:28:10,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 07:28:10,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (1/1) ... [2025-03-08 07:28:10,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 07:28:10,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:28:10,683 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:28:10,685 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:28:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 07:28:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 07:28:10,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 07:28:10,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 07:28:10,797 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 07:28:10,799 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 07:28:14,113 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5256: havoc calculate_output3_#t~ret47#1; [2025-03-08 07:28:14,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc calculate_output_#t~ret45#1; [2025-03-08 07:28:14,115 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3766: havoc calculate_output2_#t~ret46#1; [2025-03-08 07:28:14,257 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2025-03-08 07:28:14,257 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 07:28:14,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 07:28:14,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 07:28:14,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:28:14 BoogieIcfgContainer [2025-03-08 07:28:14,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 07:28:14,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 07:28:14,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 07:28:14,292 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 07:28:14,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:28:08" (1/3) ... [2025-03-08 07:28:14,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c12c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:28:14, skipping insertion in model container [2025-03-08 07:28:14,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:28:09" (2/3) ... [2025-03-08 07:28:14,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328c12c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:28:14, skipping insertion in model container [2025-03-08 07:28:14,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:28:14" (3/3) ... [2025-03-08 07:28:14,294 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c [2025-03-08 07:28:14,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 07:28:14,306 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.7.ufo.UNBOUNDED.pals+Problem12_label08.c that has 1 procedures, 931 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-08 07:28:14,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 07:28:14,380 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;@4207e9e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 07:28:14,380 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 07:28:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 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:28:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 07:28:14,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:14,394 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] [2025-03-08 07:28:14,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:14,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1710653810, now seen corresponding path program 1 times [2025-03-08 07:28:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346743681] [2025-03-08 07:28:14,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:14,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:14,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 07:28:14,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 07:28:14,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:14,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:14,604 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:28:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346743681] [2025-03-08 07:28:14,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346743681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:14,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:14,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:28:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324845312] [2025-03-08 07:28:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 07:28:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:14,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 07:28:14,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 07:28:14,628 INFO L87 Difference]: Start difference. First operand has 931 states, 928 states have (on average 1.9019396551724137) internal successors, (1765), 930 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:14,696 INFO L93 Difference]: Finished difference Result 1805 states and 3421 transitions. [2025-03-08 07:28:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 07:28:14,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 07:28:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:14,716 INFO L225 Difference]: With dead ends: 1805 [2025-03-08 07:28:14,716 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 07:28:14,722 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:28:14,724 INFO L435 NwaCegarLoop]: 1699 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, 1699 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:28:14,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1699 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 07:28:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-08 07:28:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8923611111111112) internal successors, (1635), 865 states have internal predecessors, (1635), 0 states have call successors, (0), 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:28:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1635 transitions. [2025-03-08 07:28:14,798 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1635 transitions. Word has length 28 [2025-03-08 07:28:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:14,799 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1635 transitions. [2025-03-08 07:28:14,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1635 transitions. [2025-03-08 07:28:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 07:28:14,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:14,801 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] [2025-03-08 07:28:14,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 07:28:14,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:14,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash 546257197, now seen corresponding path program 1 times [2025-03-08 07:28:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70824389] [2025-03-08 07:28:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:14,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 07:28:14,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 07:28:14,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:14,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:15,030 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:28:15,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:15,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70824389] [2025-03-08 07:28:15,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70824389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:15,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:15,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:28:15,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564103659] [2025-03-08 07:28:15,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:15,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:28:15,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:15,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:28:15,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:28:15,032 INFO L87 Difference]: Start difference. First operand 866 states and 1635 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:15,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:15,135 INFO L93 Difference]: Finished difference Result 926 states and 1729 transitions. [2025-03-08 07:28:15,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 07:28:15,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-03-08 07:28:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:15,138 INFO L225 Difference]: With dead ends: 926 [2025-03-08 07:28:15,139 INFO L226 Difference]: Without dead ends: 866 [2025-03-08 07:28:15,139 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:28:15,140 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 0 mSDsluCounter, 4844 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6477 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:15,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6477 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:15,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-08 07:28:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2025-03-08 07:28:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 866 states, 864 states have (on average 1.8344907407407407) internal successors, (1585), 865 states have internal predecessors, (1585), 0 states have call successors, (0), 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:28:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1585 transitions. [2025-03-08 07:28:15,165 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1585 transitions. Word has length 28 [2025-03-08 07:28:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:15,165 INFO L471 AbstractCegarLoop]: Abstraction has 866 states and 1585 transitions. [2025-03-08 07:28:15,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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:28:15,166 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1585 transitions. [2025-03-08 07:28:15,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 07:28:15,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:15,168 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:28:15,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 07:28:15,168 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:15,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:15,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1363454185, now seen corresponding path program 1 times [2025-03-08 07:28:15,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486328814] [2025-03-08 07:28:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:15,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:15,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 07:28:15,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 07:28:15,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:15,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:15,241 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:28:15,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:15,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486328814] [2025-03-08 07:28:15,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486328814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:15,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:15,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:28:15,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471359982] [2025-03-08 07:28:15,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:15,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:15,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:15,243 INFO L87 Difference]: Start difference. First operand 866 states and 1585 transitions. Second operand has 3 states, 3 states have (on average 10.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:28:17,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:17,827 INFO L93 Difference]: Finished difference Result 2370 states and 4458 transitions. [2025-03-08 07:28:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.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:28:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:17,833 INFO L225 Difference]: With dead ends: 2370 [2025-03-08 07:28:17,833 INFO L226 Difference]: Without dead ends: 1617 [2025-03-08 07:28:17,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:17,834 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 934 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:17,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 574 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 07:28:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2025-03-08 07:28:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1617. [2025-03-08 07:28:17,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1615 states have (on average 1.6173374613003095) internal successors, (2612), 1616 states have internal predecessors, (2612), 0 states have call successors, (0), 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:28:17,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2612 transitions. [2025-03-08 07:28:17,863 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2612 transitions. Word has length 30 [2025-03-08 07:28:17,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:17,864 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2612 transitions. [2025-03-08 07:28:17,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.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:28:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2612 transitions. [2025-03-08 07:28:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 07:28:17,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:17,867 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] [2025-03-08 07:28:17,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 07:28:17,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:17,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1657211218, now seen corresponding path program 1 times [2025-03-08 07:28:17,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345322025] [2025-03-08 07:28:17,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:17,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:17,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 07:28:17,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 07:28:17,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:17,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:18,095 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:28:18,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:18,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345322025] [2025-03-08 07:28:18,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345322025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:18,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026561818] [2025-03-08 07:28:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:18,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:18,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:18,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:18,097 INFO L87 Difference]: Start difference. First operand 1617 states and 2612 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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:28:18,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:18,399 INFO L93 Difference]: Finished difference Result 2401 states and 3872 transitions. [2025-03-08 07:28:18,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 07:28:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-08 07:28:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,407 INFO L225 Difference]: With dead ends: 2401 [2025-03-08 07:28:18,407 INFO L226 Difference]: Without dead ends: 2345 [2025-03-08 07:28:18,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2025-03-08 07:28:18,408 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 11538 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11538 SdHoareTripleChecker+Valid, 4683 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:18,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11538 Valid, 4683 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2025-03-08 07:28:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1671. [2025-03-08 07:28:18,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1669 states have (on average 1.6171360095865788) internal successors, (2699), 1670 states have internal predecessors, (2699), 0 states have call successors, (0), 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:28:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2699 transitions. [2025-03-08 07:28:18,441 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2699 transitions. Word has length 77 [2025-03-08 07:28:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:18,441 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2699 transitions. [2025-03-08 07:28:18,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 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:28:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2699 transitions. [2025-03-08 07:28:18,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:28:18,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:18,443 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] [2025-03-08 07:28:18,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 07:28:18,443 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:18,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1973239561, now seen corresponding path program 1 times [2025-03-08 07:28:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:18,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116478913] [2025-03-08 07:28:18,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:18,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:28:18,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:28:18,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:18,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:18,575 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:28:18,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:18,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116478913] [2025-03-08 07:28:18,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116478913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:18,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545770969] [2025-03-08 07:28:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:18,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:18,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:18,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:18,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:18,576 INFO L87 Difference]: Start difference. First operand 1671 states and 2699 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:28:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:18,611 INFO L93 Difference]: Finished difference Result 1880 states and 3034 transitions. [2025-03-08 07:28:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 07:28:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:18,617 INFO L225 Difference]: With dead ends: 1880 [2025-03-08 07:28:18,617 INFO L226 Difference]: Without dead ends: 1770 [2025-03-08 07:28:18,618 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:28:18,620 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 1500 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1664 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:28:18,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1664 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-03-08 07:28:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1766. [2025-03-08 07:28:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6150793650793651) internal successors, (2849), 1765 states have internal predecessors, (2849), 0 states have call successors, (0), 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:28:18,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2849 transitions. [2025-03-08 07:28:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2849 transitions. Word has length 79 [2025-03-08 07:28:18,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:18,655 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2849 transitions. [2025-03-08 07:28:18,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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:28:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2849 transitions. [2025-03-08 07:28:18,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 07:28:18,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:18,656 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] [2025-03-08 07:28:18,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 07:28:18,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:18,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:18,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2005562796, now seen corresponding path program 1 times [2025-03-08 07:28:18,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:18,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246551632] [2025-03-08 07:28:18,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 07:28:18,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 07:28:18,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:18,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,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:28:19,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246551632] [2025-03-08 07:28:19,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246551632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166160982] [2025-03-08 07:28:19,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:19,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:19,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:19,010 INFO L87 Difference]: Start difference. First operand 1766 states and 2849 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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:28:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:19,273 INFO L93 Difference]: Finished difference Result 1973 states and 3177 transitions. [2025-03-08 07:28:19,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-08 07:28:19,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:19,280 INFO L225 Difference]: With dead ends: 1973 [2025-03-08 07:28:19,280 INFO L226 Difference]: Without dead ends: 1768 [2025-03-08 07:28:19,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-03-08 07:28:19,283 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 7570 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7570 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:19,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7570 Valid, 2099 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2025-03-08 07:28:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1766. [2025-03-08 07:28:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.6139455782312926) internal successors, (2847), 1765 states have internal predecessors, (2847), 0 states have call successors, (0), 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:28:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2847 transitions. [2025-03-08 07:28:19,315 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2847 transitions. Word has length 79 [2025-03-08 07:28:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,316 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2847 transitions. [2025-03-08 07:28:19,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 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:28:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2847 transitions. [2025-03-08 07:28:19,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 07:28:19,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,317 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] [2025-03-08 07:28:19,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 07:28:19,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2073442266, now seen corresponding path program 1 times [2025-03-08 07:28:19,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634991198] [2025-03-08 07:28:19,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:19,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 07:28:19,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 07:28:19,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:19,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,558 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:28:19,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634991198] [2025-03-08 07:28:19,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634991198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 07:28:19,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255281221] [2025-03-08 07:28:19,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 07:28:19,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 07:28:19,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 07:28:19,560 INFO L87 Difference]: Start difference. First operand 1766 states and 2847 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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:28:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:19,611 INFO L93 Difference]: Finished difference Result 1774 states and 2856 transitions. [2025-03-08 07:28:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 07:28:19,612 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-08 07:28:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:19,617 INFO L225 Difference]: With dead ends: 1774 [2025-03-08 07:28:19,617 INFO L226 Difference]: Without dead ends: 1772 [2025-03-08 07:28:19,617 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:28:19,618 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 0 mSDsluCounter, 9461 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11040 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:28:19,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11040 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:19,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-08 07:28:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2025-03-08 07:28:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1770 states have (on average 1.6112994350282486) internal successors, (2852), 1771 states have internal predecessors, (2852), 0 states have call successors, (0), 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:28:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2852 transitions. [2025-03-08 07:28:19,642 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2852 transitions. Word has length 80 [2025-03-08 07:28:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,642 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2852 transitions. [2025-03-08 07:28:19,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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:28:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2852 transitions. [2025-03-08 07:28:19,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:19,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,643 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] [2025-03-08 07:28:19,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 07:28:19,643 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -607984566, now seen corresponding path program 1 times [2025-03-08 07:28:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713518978] [2025-03-08 07:28:19,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:19,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:19,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:19,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:19,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,691 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:28:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713518978] [2025-03-08 07:28:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713518978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625071914] [2025-03-08 07:28:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:19,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:19,692 INFO L87 Difference]: Start difference. First operand 1772 states and 2852 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:19,716 INFO L93 Difference]: Finished difference Result 2178 states and 3484 transitions. [2025-03-08 07:28:19,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:19,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:19,722 INFO L225 Difference]: With dead ends: 2178 [2025-03-08 07:28:19,722 INFO L226 Difference]: Without dead ends: 1967 [2025-03-08 07:28:19,723 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:28:19,724 INFO L435 NwaCegarLoop]: 1652 mSDtfsCounter, 1517 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1747 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:28:19,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1747 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1967 states. [2025-03-08 07:28:19,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1967 to 1965. [2025-03-08 07:28:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1963 states have (on average 1.6041772796739684) internal successors, (3149), 1964 states have internal predecessors, (3149), 0 states have call successors, (0), 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:28:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 3149 transitions. [2025-03-08 07:28:19,783 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 3149 transitions. Word has length 81 [2025-03-08 07:28:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,785 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 3149 transitions. [2025-03-08 07:28:19,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 3149 transitions. [2025-03-08 07:28:19,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:19,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,787 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] [2025-03-08 07:28:19,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:28:19,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,787 INFO L85 PathProgramCache]: Analyzing trace with hash -762353398, now seen corresponding path program 1 times [2025-03-08 07:28:19,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771277407] [2025-03-08 07:28:19,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:19,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:19,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:19,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:19,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,845 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:28:19,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771277407] [2025-03-08 07:28:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771277407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:19,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469782049] [2025-03-08 07:28:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:19,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:19,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:19,847 INFO L87 Difference]: Start difference. First operand 1965 states and 3149 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:19,875 INFO L93 Difference]: Finished difference Result 2741 states and 4347 transitions. [2025-03-08 07:28:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:19,882 INFO L225 Difference]: With dead ends: 2741 [2025-03-08 07:28:19,882 INFO L226 Difference]: Without dead ends: 2337 [2025-03-08 07:28:19,884 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:28:19,886 INFO L435 NwaCegarLoop]: 1650 mSDtfsCounter, 1515 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 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:28:19,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2025-03-08 07:28:19,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2335. [2025-03-08 07:28:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2335 states, 2333 states have (on average 1.5906558079725674) internal successors, (3711), 2334 states have internal predecessors, (3711), 0 states have call successors, (0), 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:28:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 3711 transitions. [2025-03-08 07:28:19,931 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 3711 transitions. Word has length 81 [2025-03-08 07:28:19,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:19,931 INFO L471 AbstractCegarLoop]: Abstraction has 2335 states and 3711 transitions. [2025-03-08 07:28:19,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:19,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 3711 transitions. [2025-03-08 07:28:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:19,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:19,932 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] [2025-03-08 07:28:19,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:28:19,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:19,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:19,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1741283894, now seen corresponding path program 1 times [2025-03-08 07:28:19,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:19,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867502186] [2025-03-08 07:28:19,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:19,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:19,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:19,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:19,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:19,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:19,992 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:28:19,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:19,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867502186] [2025-03-08 07:28:19,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867502186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:19,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:19,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401011926] [2025-03-08 07:28:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:19,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:19,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:19,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:19,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:19,994 INFO L87 Difference]: Start difference. First operand 2335 states and 3711 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:20,034 INFO L93 Difference]: Finished difference Result 3819 states and 5977 transitions. [2025-03-08 07:28:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:20,046 INFO L225 Difference]: With dead ends: 3819 [2025-03-08 07:28:20,046 INFO L226 Difference]: Without dead ends: 3045 [2025-03-08 07:28:20,049 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:28:20,049 INFO L435 NwaCegarLoop]: 1648 mSDtfsCounter, 1513 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1751 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:28:20,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1513 Valid, 1751 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:20,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2025-03-08 07:28:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3043. [2025-03-08 07:28:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 3041 states have (on average 1.568891811903979) internal successors, (4771), 3042 states have internal predecessors, (4771), 0 states have call successors, (0), 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:28:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 4771 transitions. [2025-03-08 07:28:20,112 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 4771 transitions. Word has length 81 [2025-03-08 07:28:20,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:20,112 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 4771 transitions. [2025-03-08 07:28:20,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 4771 transitions. [2025-03-08 07:28:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:20,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:20,113 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] [2025-03-08 07:28:20,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:28:20,114 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:20,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2105737866, now seen corresponding path program 1 times [2025-03-08 07:28:20,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:20,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798154276] [2025-03-08 07:28:20,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:20,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:20,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:20,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:20,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:20,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:20,179 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:28:20,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:20,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798154276] [2025-03-08 07:28:20,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798154276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:20,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:20,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:20,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332084021] [2025-03-08 07:28:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:20,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:20,181 INFO L87 Difference]: Start difference. First operand 3043 states and 4771 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:20,234 INFO L93 Difference]: Finished difference Result 5879 states and 9045 transitions. [2025-03-08 07:28:20,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:20,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:20,250 INFO L225 Difference]: With dead ends: 5879 [2025-03-08 07:28:20,251 INFO L226 Difference]: Without dead ends: 4397 [2025-03-08 07:28:20,254 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:28:20,255 INFO L435 NwaCegarLoop]: 1646 mSDtfsCounter, 1511 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1753 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:28:20,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1753 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2025-03-08 07:28:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 4395. [2025-03-08 07:28:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4395 states, 4393 states have (on average 1.539494650580469) internal successors, (6763), 4394 states have internal predecessors, (6763), 0 states have call successors, (0), 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:28:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6763 transitions. [2025-03-08 07:28:20,354 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6763 transitions. Word has length 81 [2025-03-08 07:28:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 4395 states and 6763 transitions. [2025-03-08 07:28:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6763 transitions. [2025-03-08 07:28:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:20,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:20,356 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] [2025-03-08 07:28:20,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:28:20,356 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1774053558, now seen corresponding path program 1 times [2025-03-08 07:28:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672434023] [2025-03-08 07:28:20,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:20,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:20,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:20,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:20,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:20,402 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:28:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672434023] [2025-03-08 07:28:20,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672434023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:20,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:20,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:20,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022082557] [2025-03-08 07:28:20,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:20,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:20,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:20,404 INFO L87 Difference]: Start difference. First operand 4395 states and 6763 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:20,477 INFO L93 Difference]: Finished difference Result 9807 states and 14797 transitions. [2025-03-08 07:28:20,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:20,503 INFO L225 Difference]: With dead ends: 9807 [2025-03-08 07:28:20,504 INFO L226 Difference]: Without dead ends: 6973 [2025-03-08 07:28:20,509 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:28:20,509 INFO L435 NwaCegarLoop]: 1644 mSDtfsCounter, 1509 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1755 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:28:20,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1755 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:20,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6973 states. [2025-03-08 07:28:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6973 to 6971. [2025-03-08 07:28:20,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6971 states, 6969 states have (on average 1.5053809728798966) internal successors, (10491), 6970 states have internal predecessors, (10491), 0 states have call successors, (0), 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:28:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6971 states to 6971 states and 10491 transitions. [2025-03-08 07:28:20,659 INFO L78 Accepts]: Start accepts. Automaton has 6971 states and 10491 transitions. Word has length 81 [2025-03-08 07:28:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:20,660 INFO L471 AbstractCegarLoop]: Abstraction has 6971 states and 10491 transitions. [2025-03-08 07:28:20,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6971 states and 10491 transitions. [2025-03-08 07:28:20,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 07:28:20,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:20,661 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] [2025-03-08 07:28:20,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:28:20,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:20,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:20,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2034195466, now seen corresponding path program 1 times [2025-03-08 07:28:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584212425] [2025-03-08 07:28:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:20,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:20,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 07:28:20,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 07:28:20,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:20,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:20,744 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:28:20,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584212425] [2025-03-08 07:28:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584212425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312069020] [2025-03-08 07:28:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:20,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:20,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:20,745 INFO L87 Difference]: Start difference. First operand 6971 states and 10491 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:20,853 INFO L93 Difference]: Finished difference Result 17279 states and 25533 transitions. [2025-03-08 07:28:20,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:20,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-08 07:28:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:20,874 INFO L225 Difference]: With dead ends: 17279 [2025-03-08 07:28:20,874 INFO L226 Difference]: Without dead ends: 11869 [2025-03-08 07:28:20,884 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:28:20,885 INFO L435 NwaCegarLoop]: 1642 mSDtfsCounter, 1507 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1757 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:28:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1757 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11869 states. [2025-03-08 07:28:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11869 to 11867. [2025-03-08 07:28:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11867 states, 11865 states have (on average 1.4694479561736198) internal successors, (17435), 11866 states have internal predecessors, (17435), 0 states have call successors, (0), 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:28:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11867 states to 11867 states and 17435 transitions. [2025-03-08 07:28:21,127 INFO L78 Accepts]: Start accepts. Automaton has 11867 states and 17435 transitions. Word has length 81 [2025-03-08 07:28:21,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:21,127 INFO L471 AbstractCegarLoop]: Abstraction has 11867 states and 17435 transitions. [2025-03-08 07:28:21,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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:28:21,127 INFO L276 IsEmpty]: Start isEmpty. Operand 11867 states and 17435 transitions. [2025-03-08 07:28:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 07:28:21,128 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:21,128 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] [2025-03-08 07:28:21,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 07:28:21,128 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:21,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:21,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1506966134, now seen corresponding path program 1 times [2025-03-08 07:28:21,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:21,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096492224] [2025-03-08 07:28:21,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:21,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:21,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 07:28:21,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 07:28:21,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:21,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:21,173 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:28:21,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:21,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096492224] [2025-03-08 07:28:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096492224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:21,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 07:28:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505157677] [2025-03-08 07:28:21,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:21,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:21,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:21,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:21,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:21,175 INFO L87 Difference]: Start difference. First operand 11867 states and 17435 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:28:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:21,388 INFO L93 Difference]: Finished difference Result 22626 states and 33185 transitions. [2025-03-08 07:28:21,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:21,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-08 07:28:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:21,421 INFO L225 Difference]: With dead ends: 22626 [2025-03-08 07:28:21,422 INFO L226 Difference]: Without dead ends: 16863 [2025-03-08 07:28:21,429 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:28:21,430 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 1516 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1516 SdHoareTripleChecker+Valid, 1748 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:28:21,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1516 Valid, 1748 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:28:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16863 states. [2025-03-08 07:28:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16863 to 16861. [2025-03-08 07:28:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16861 states, 16859 states have (on average 1.455661664392906) internal successors, (24541), 16860 states have internal predecessors, (24541), 0 states have call successors, (0), 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:28:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16861 states to 16861 states and 24541 transitions. [2025-03-08 07:28:21,790 INFO L78 Accepts]: Start accepts. Automaton has 16861 states and 24541 transitions. Word has length 83 [2025-03-08 07:28:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:21,790 INFO L471 AbstractCegarLoop]: Abstraction has 16861 states and 24541 transitions. [2025-03-08 07:28:21,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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:28:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16861 states and 24541 transitions. [2025-03-08 07:28:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 07:28:21,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:21,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:21,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 07:28:21,793 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:21,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:21,794 INFO L85 PathProgramCache]: Analyzing trace with hash 603394773, now seen corresponding path program 1 times [2025-03-08 07:28:21,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:21,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158859151] [2025-03-08 07:28:21,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:21,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:21,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 07:28:21,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 07:28:21,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:21,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 07:28:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158859151] [2025-03-08 07:28:21,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158859151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:21,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:21,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 07:28:21,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898521273] [2025-03-08 07:28:21,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:21,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:28:21,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:21,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:28:21,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:21,857 INFO L87 Difference]: Start difference. First operand 16861 states and 24541 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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:28:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:24,458 INFO L93 Difference]: Finished difference Result 19867 states and 29468 transitions. [2025-03-08 07:28:24,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:28:24,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 101 [2025-03-08 07:28:24,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:24,492 INFO L225 Difference]: With dead ends: 19867 [2025-03-08 07:28:24,492 INFO L226 Difference]: Without dead ends: 18363 [2025-03-08 07:28:24,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 07:28:24,500 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 871 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:24,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 621 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 07:28:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18363 states. [2025-03-08 07:28:24,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18363 to 18363. [2025-03-08 07:28:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18363 states, 18361 states have (on average 1.4357061162246065) internal successors, (26361), 18362 states have internal predecessors, (26361), 0 states have call successors, (0), 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:28:24,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18363 states to 18363 states and 26361 transitions. [2025-03-08 07:28:24,780 INFO L78 Accepts]: Start accepts. Automaton has 18363 states and 26361 transitions. Word has length 101 [2025-03-08 07:28:24,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:24,781 INFO L471 AbstractCegarLoop]: Abstraction has 18363 states and 26361 transitions. [2025-03-08 07:28:24,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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:28:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 18363 states and 26361 transitions. [2025-03-08 07:28:24,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:24,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:24,785 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:24,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 07:28:24,785 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:24,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:24,785 INFO L85 PathProgramCache]: Analyzing trace with hash 113999974, now seen corresponding path program 1 times [2025-03-08 07:28:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:24,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338749231] [2025-03-08 07:28:24,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:24,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:24,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:24,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:24,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:24,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 07:28:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338749231] [2025-03-08 07:28:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338749231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:25,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116460515] [2025-03-08 07:28:25,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:25,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:25,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:25,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:25,023 INFO L87 Difference]: Start difference. First operand 18363 states and 26361 transitions. Second operand has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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:28:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:26,322 INFO L93 Difference]: Finished difference Result 128587 states and 184833 transitions. [2025-03-08 07:28:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:26,561 INFO L225 Difference]: With dead ends: 128587 [2025-03-08 07:28:26,561 INFO L226 Difference]: Without dead ends: 113289 [2025-03-08 07:28:26,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:26,595 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 9826 mSDsluCounter, 2959 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9826 SdHoareTripleChecker+Valid, 4637 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:26,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9826 Valid, 4637 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113289 states. [2025-03-08 07:28:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113289 to 33659. [2025-03-08 07:28:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33659 states, 33657 states have (on average 1.4316486912083668) internal successors, (48185), 33658 states have internal predecessors, (48185), 0 states have call successors, (0), 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:28:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33659 states to 33659 states and 48185 transitions. [2025-03-08 07:28:27,822 INFO L78 Accepts]: Start accepts. Automaton has 33659 states and 48185 transitions. Word has length 104 [2025-03-08 07:28:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 33659 states and 48185 transitions. [2025-03-08 07:28:27,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.222222222222221) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 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:28:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 33659 states and 48185 transitions. [2025-03-08 07:28:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:27,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:27,827 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:27,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 07:28:27,828 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:27,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash -40368858, now seen corresponding path program 1 times [2025-03-08 07:28:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:27,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459033218] [2025-03-08 07:28:27,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:27,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:27,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:27,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:27,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 07:28:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459033218] [2025-03-08 07:28:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459033218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:28,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:28,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:28,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319795567] [2025-03-08 07:28:28,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:28,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:28,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:28,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:28,007 INFO L87 Difference]: Start difference. First operand 33659 states and 48185 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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:28:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:29,664 INFO L93 Difference]: Finished difference Result 143883 states and 206657 transitions. [2025-03-08 07:28:29,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:29,665 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:29,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:29,865 INFO L225 Difference]: With dead ends: 143883 [2025-03-08 07:28:29,865 INFO L226 Difference]: Without dead ends: 128585 [2025-03-08 07:28:29,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:29,905 INFO L435 NwaCegarLoop]: 1675 mSDtfsCounter, 9851 mSDsluCounter, 2822 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9851 SdHoareTripleChecker+Valid, 4497 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:29,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9851 Valid, 4497 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:29,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128585 states. [2025-03-08 07:28:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128585 to 56635. [2025-03-08 07:28:31,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56635 states, 56633 states have (on average 1.4260413539808945) internal successors, (80761), 56634 states have internal predecessors, (80761), 0 states have call successors, (0), 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:28:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56635 states to 56635 states and 80761 transitions. [2025-03-08 07:28:31,941 INFO L78 Accepts]: Start accepts. Automaton has 56635 states and 80761 transitions. Word has length 104 [2025-03-08 07:28:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:31,942 INFO L471 AbstractCegarLoop]: Abstraction has 56635 states and 80761 transitions. [2025-03-08 07:28:31,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 9 states have internal predecessors, (99), 0 states have call successors, (0), 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:28:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 56635 states and 80761 transitions. [2025-03-08 07:28:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:31,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:31,947 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 07:28:31,948 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:31,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1019299354, now seen corresponding path program 1 times [2025-03-08 07:28:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263746864] [2025-03-08 07:28:31,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:31,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:31,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:31,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:31,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:32,096 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 07:28:32,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:32,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263746864] [2025-03-08 07:28:32,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263746864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:32,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:32,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938490457] [2025-03-08 07:28:32,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:32,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:32,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:32,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:32,098 INFO L87 Difference]: Start difference. First operand 56635 states and 80761 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:34,587 INFO L93 Difference]: Finished difference Result 159179 states and 228481 transitions. [2025-03-08 07:28:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:34,804 INFO L225 Difference]: With dead ends: 159179 [2025-03-08 07:28:34,804 INFO L226 Difference]: Without dead ends: 143881 [2025-03-08 07:28:34,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:34,846 INFO L435 NwaCegarLoop]: 1672 mSDtfsCounter, 9892 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9892 SdHoareTripleChecker+Valid, 4420 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:34,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9892 Valid, 4420 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143881 states. [2025-03-08 07:28:37,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143881 to 71931. [2025-03-08 07:28:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71931 states, 71929 states have (on average 1.4261980564167442) internal successors, (102585), 71930 states have internal predecessors, (102585), 0 states have call successors, (0), 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:28:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71931 states to 71931 states and 102585 transitions. [2025-03-08 07:28:37,594 INFO L78 Accepts]: Start accepts. Automaton has 71931 states and 102585 transitions. Word has length 104 [2025-03-08 07:28:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:37,595 INFO L471 AbstractCegarLoop]: Abstraction has 71931 states and 102585 transitions. [2025-03-08 07:28:37,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 07:28:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 71931 states and 102585 transitions. [2025-03-08 07:28:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:37,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:37,601 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:37,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 07:28:37,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:37,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:37,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1467244890, now seen corresponding path program 1 times [2025-03-08 07:28:37,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:37,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671587193] [2025-03-08 07:28:37,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:37,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:37,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:37,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:37,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 07:28:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671587193] [2025-03-08 07:28:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671587193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983389391] [2025-03-08 07:28:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:37,800 INFO L87 Difference]: Start difference. First operand 71931 states and 102585 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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:28:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:40,728 INFO L93 Difference]: Finished difference Result 174475 states and 250305 transitions. [2025-03-08 07:28:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:40,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-08 07:28:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:40,972 INFO L225 Difference]: With dead ends: 174475 [2025-03-08 07:28:40,972 INFO L226 Difference]: Without dead ends: 159177 [2025-03-08 07:28:41,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:41,013 INFO L435 NwaCegarLoop]: 1669 mSDtfsCounter, 9946 mSDsluCounter, 2687 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9946 SdHoareTripleChecker+Valid, 4356 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:41,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9946 Valid, 4356 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159177 states. [2025-03-08 07:28:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159177 to 87227. [2025-03-08 07:28:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87227 states, 87225 states have (on average 1.4262997993694468) internal successors, (124409), 87226 states have internal predecessors, (124409), 0 states have call successors, (0), 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:28:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87227 states to 87227 states and 124409 transitions. [2025-03-08 07:28:43,466 INFO L78 Accepts]: Start accepts. Automaton has 87227 states and 124409 transitions. Word has length 104 [2025-03-08 07:28:43,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:43,467 INFO L471 AbstractCegarLoop]: Abstraction has 87227 states and 124409 transitions. [2025-03-08 07:28:43,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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:28:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 87227 states and 124409 transitions. [2025-03-08 07:28:43,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:43,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:43,471 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:43,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 07:28:43,472 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:43,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1052069018, now seen corresponding path program 1 times [2025-03-08 07:28:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:43,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92322911] [2025-03-08 07:28:43,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:43,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:43,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:43,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:43,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 07:28:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92322911] [2025-03-08 07:28:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92322911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:43,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:43,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:43,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716406093] [2025-03-08 07:28:43,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:43,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:43,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:43,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:43,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:43,625 INFO L87 Difference]: Start difference. First operand 87227 states and 124409 transitions. Second operand has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:28:47,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:28:47,055 INFO L93 Difference]: Finished difference Result 189771 states and 272129 transitions. [2025-03-08 07:28:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:28:47,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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 104 [2025-03-08 07:28:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:28:47,306 INFO L225 Difference]: With dead ends: 189771 [2025-03-08 07:28:47,306 INFO L226 Difference]: Without dead ends: 174473 [2025-03-08 07:28:47,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2025-03-08 07:28:47,350 INFO L435 NwaCegarLoop]: 1666 mSDtfsCounter, 10001 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10001 SdHoareTripleChecker+Valid, 4413 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:28:47,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10001 Valid, 4413 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:28:47,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174473 states. [2025-03-08 07:28:50,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174473 to 102523. [2025-03-08 07:28:50,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102523 states, 102521 states have (on average 1.4263711824894412) internal successors, (146233), 102522 states have internal predecessors, (146233), 0 states have call successors, (0), 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:28:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102523 states to 102523 states and 146233 transitions. [2025-03-08 07:28:50,379 INFO L78 Accepts]: Start accepts. Automaton has 102523 states and 146233 transitions. Word has length 104 [2025-03-08 07:28:50,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:28:50,379 INFO L471 AbstractCegarLoop]: Abstraction has 102523 states and 146233 transitions. [2025-03-08 07:28:50,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.333333333333334) internal successors, (93), 9 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:28:50,379 INFO L276 IsEmpty]: Start isEmpty. Operand 102523 states and 146233 transitions. [2025-03-08 07:28:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 07:28:50,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:28:50,383 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 07:28:50,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 07:28:50,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:28:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:28:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1538787290, now seen corresponding path program 1 times [2025-03-08 07:28:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:28:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694111930] [2025-03-08 07:28:50,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:28:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:28:50,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 07:28:50,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 07:28:50,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:28:50,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:28:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:28:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:28:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694111930] [2025-03-08 07:28:50,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694111930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:28:50,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:28:50,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 07:28:50,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495961065] [2025-03-08 07:28:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:28:50,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 07:28:50,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:28:50,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 07:28:50,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:28:50,523 INFO L87 Difference]: Start difference. First operand 102523 states and 146233 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)