./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.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 1b5bedda6fafe9d5e27c46cd442327641e760ea4d9632bf3cdc5cb7e6cff3dd5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:12:41,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:12:41,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:12:41,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:12:41,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:12:41,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:12:41,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:12:41,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:12:41,759 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:12:41,759 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:12:41,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:12:41,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:12:41,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:12:41,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:12:41,760 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:12:41,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:12:41,761 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:12:41,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:12:41,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:12:41,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:12:41,762 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 -> 1b5bedda6fafe9d5e27c46cd442327641e760ea4d9632bf3cdc5cb7e6cff3dd5 [2025-03-03 16:12:42,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:12:42,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:12:42,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:12:42,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:12:42,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:12:42,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-03-03 16:12:43,180 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf6f6227/8b8d5a85d5694bac832b03eb3c6ae41b/FLAGcaa23dfa8 [2025-03-03 16:12:43,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:12:43,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-03-03 16:12:43,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf6f6227/8b8d5a85d5694bac832b03eb3c6ae41b/FLAGcaa23dfa8 [2025-03-03 16:12:43,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf6f6227/8b8d5a85d5694bac832b03eb3c6ae41b [2025-03-03 16:12:43,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:12:43,761 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:12:43,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:12:43,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:12:43,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:12:43,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:12:43" (1/1) ... [2025-03-03 16:12:43,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7f1dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:43, skipping insertion in model container [2025-03-03 16:12:43,768 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:12:43" (1/1) ... [2025-03-03 16:12:43,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:12:44,129 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.6.ufo.BOUNDED-12.pals+Problem12_label06.c[15482,15495] [2025-03-03 16:12:44,167 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.6.ufo.BOUNDED-12.pals+Problem12_label06.c[18299,18312] [2025-03-03 16:12:44,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:12:44,545 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:12:44,563 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.6.ufo.BOUNDED-12.pals+Problem12_label06.c[15482,15495] [2025-03-03 16:12:44,567 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.6.ufo.BOUNDED-12.pals+Problem12_label06.c[18299,18312] [2025-03-03 16:12:44,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:12:44,825 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:12:44,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44 WrapperNode [2025-03-03 16:12:44,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:12:44,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:12:44,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:12:44,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:12:44,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:44,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,153 INFO L138 Inliner]: procedures = 37, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5153 [2025-03-03 16:12:45,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:12:45,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:12:45,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:12:45,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:12:45,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,345 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:12:45,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,483 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:12:45,575 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:12:45,576 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:12:45,576 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:12:45,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (1/1) ... [2025-03-03 16:12:45,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:12:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:12:45,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:12:45,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:12:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:12:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:12:45,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:12:45,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:12:45,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:12:45,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:12:49,163 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3683: havoc calculate_output2_#t~ret43#1; [2025-03-03 16:12:49,163 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5173: havoc calculate_output3_#t~ret44#1; [2025-03-03 16:12:49,164 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2204: havoc calculate_output_#t~ret42#1; [2025-03-03 16:12:49,306 INFO L? ?]: Removed 749 outVars from TransFormulas that were not future-live. [2025-03-03 16:12:49,306 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:12:49,330 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:12:49,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:12:49,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:12:49 BoogieIcfgContainer [2025-03-03 16:12:49,332 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:12:49,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:12:49,336 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:12:49,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:12:49,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:12:43" (1/3) ... [2025-03-03 16:12:49,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639d4644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:12:49, skipping insertion in model container [2025-03-03 16:12:49,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:12:44" (2/3) ... [2025-03-03 16:12:49,342 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@639d4644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:12:49, skipping insertion in model container [2025-03-03 16:12:49,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:12:49" (3/3) ... [2025-03-03 16:12:49,345 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c [2025-03-03 16:12:49,356 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:12:49,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals+Problem12_label06.c that has 1 procedures, 913 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:12:49,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:12:49,426 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;@551a476e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:12:49,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:12:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 16:12:49,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:49,440 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] [2025-03-03 16:12:49,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:49,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:49,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1938753728, now seen corresponding path program 1 times [2025-03-03 16:12:49,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:49,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066297780] [2025-03-03 16:12:49,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:49,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 16:12:49,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 16:12:49,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:49,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:49,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:49,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066297780] [2025-03-03 16:12:49,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066297780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:49,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:49,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:12:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460035212] [2025-03-03 16:12:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:49,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:49,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:49,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:49,738 INFO L87 Difference]: Start difference. First operand has 913 states, 910 states have (on average 1.9032967032967032) internal successors, (1732), 912 states have internal predecessors, (1732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:52,366 INFO L93 Difference]: Finished difference Result 2535 states and 4877 transitions. [2025-03-03 16:12:52,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-03 16:12:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:52,388 INFO L225 Difference]: With dead ends: 2535 [2025-03-03 16:12:52,388 INFO L226 Difference]: Without dead ends: 1599 [2025-03-03 16:12:52,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:52,394 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 976 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:52,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 648 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 16:12:52,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-03 16:12:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-03-03 16:12:52,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.646211646837821) internal successors, (2629), 1598 states have internal predecessors, (2629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2629 transitions. [2025-03-03 16:12:52,476 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2629 transitions. Word has length 24 [2025-03-03 16:12:52,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:52,476 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2629 transitions. [2025-03-03 16:12:52,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2629 transitions. [2025-03-03 16:12:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 16:12:52,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:52,477 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] [2025-03-03 16:12:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:12:52,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:52,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1393035855, now seen corresponding path program 1 times [2025-03-03 16:12:52,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:52,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369606274] [2025-03-03 16:12:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:52,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 16:12:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 16:12:52,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:52,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:52,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:52,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369606274] [2025-03-03 16:12:52,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369606274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:52,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:52,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:12:52,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861763874] [2025-03-03 16:12:52,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:52,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:12:52,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:52,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:12:52,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:12:52,665 INFO L87 Difference]: Start difference. First operand 1599 states and 2629 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:52,724 INFO L93 Difference]: Finished difference Result 1651 states and 2710 transitions. [2025-03-03 16:12:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:12:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-03-03 16:12:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:52,730 INFO L225 Difference]: With dead ends: 1651 [2025-03-03 16:12:52,730 INFO L226 Difference]: Without dead ends: 1599 [2025-03-03 16:12:52,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:12:52,731 INFO L435 NwaCegarLoop]: 1600 mSDtfsCounter, 0 mSDsluCounter, 4755 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6355 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:52,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6355 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-03-03 16:12:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2025-03-03 16:12:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 1597 states have (on average 1.6211646837820914) internal successors, (2589), 1598 states have internal predecessors, (2589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2589 transitions. [2025-03-03 16:12:52,759 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2589 transitions. Word has length 26 [2025-03-03 16:12:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:52,759 INFO L471 AbstractCegarLoop]: Abstraction has 1599 states and 2589 transitions. [2025-03-03 16:12:52,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2589 transitions. [2025-03-03 16:12:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:12:52,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:52,761 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] [2025-03-03 16:12:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:12:52,761 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 720868248, now seen corresponding path program 1 times [2025-03-03 16:12:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807165157] [2025-03-03 16:12:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:52,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:12:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:12:52,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:52,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807165157] [2025-03-03 16:12:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807165157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:52,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:52,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695791816] [2025-03-03 16:12:52,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:52,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:52,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:52,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:52,971 INFO L87 Difference]: Start difference. First operand 1599 states and 2589 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:53,246 INFO L93 Difference]: Finished difference Result 2175 states and 3513 transitions. [2025-03-03 16:12:53,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:12:53,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-03 16:12:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:53,256 INFO L225 Difference]: With dead ends: 2175 [2025-03-03 16:12:53,257 INFO L226 Difference]: Without dead ends: 2127 [2025-03-03 16:12:53,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-03 16:12:53,261 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 9635 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9635 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:53,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9635 Valid, 3990 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2025-03-03 16:12:53,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1645. [2025-03-03 16:12:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1643 states have (on average 1.620815581253804) internal successors, (2663), 1644 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2663 transitions. [2025-03-03 16:12:53,296 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2663 transitions. Word has length 65 [2025-03-03 16:12:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:53,297 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2663 transitions. [2025-03-03 16:12:53,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2663 transitions. [2025-03-03 16:12:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:12:53,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:53,301 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] [2025-03-03 16:12:53,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:12:53,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1909962381, now seen corresponding path program 1 times [2025-03-03 16:12:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005274043] [2025-03-03 16:12:53,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:12:53,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:12:53,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:53,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:53,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:53,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005274043] [2025-03-03 16:12:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005274043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:53,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769071502] [2025-03-03 16:12:53,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:53,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:53,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:53,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:53,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:53,409 INFO L87 Difference]: Start difference. First operand 1645 states and 2663 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:53,437 INFO L93 Difference]: Finished difference Result 1822 states and 2946 transitions. [2025-03-03 16:12:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 16:12:53,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:53,443 INFO L225 Difference]: With dead ends: 1822 [2025-03-03 16:12:53,444 INFO L226 Difference]: Without dead ends: 1728 [2025-03-03 16:12:53,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:53,447 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:53,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1632 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-03-03 16:12:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-03-03 16:12:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.618909512761021) internal successors, (2791), 1725 states have internal predecessors, (2791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2791 transitions. [2025-03-03 16:12:53,485 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2791 transitions. Word has length 67 [2025-03-03 16:12:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2791 transitions. [2025-03-03 16:12:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2791 transitions. [2025-03-03 16:12:53,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:12:53,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:53,489 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] [2025-03-03 16:12:53,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:12:53,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1877639146, now seen corresponding path program 1 times [2025-03-03 16:12:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:53,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418171393] [2025-03-03 16:12:53,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:53,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:12:53,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:12:53,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:53,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418171393] [2025-03-03 16:12:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418171393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:53,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903239447] [2025-03-03 16:12:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:53,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:53,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:53,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:53,810 INFO L87 Difference]: Start difference. First operand 1726 states and 2791 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:53,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:53,999 INFO L93 Difference]: Finished difference Result 1903 states and 3071 transitions. [2025-03-03 16:12:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:54,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-03 16:12:54,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,005 INFO L225 Difference]: With dead ends: 1903 [2025-03-03 16:12:54,005 INFO L226 Difference]: Without dead ends: 1728 [2025-03-03 16:12:54,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-03 16:12:54,006 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 4516 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4516 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4516 Valid, 1922 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2025-03-03 16:12:54,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1726. [2025-03-03 16:12:54,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 1724 states have (on average 1.6177494199535962) internal successors, (2789), 1725 states have internal predecessors, (2789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2789 transitions. [2025-03-03 16:12:54,036 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2789 transitions. Word has length 67 [2025-03-03 16:12:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 1726 states and 2789 transitions. [2025-03-03 16:12:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2789 transitions. [2025-03-03 16:12:54,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:12:54,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:12:54,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:12:54,038 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1953266352, now seen corresponding path program 1 times [2025-03-03 16:12:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192102798] [2025-03-03 16:12:54,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:12:54,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:12:54,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:54,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:54,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192102798] [2025-03-03 16:12:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192102798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:54,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:54,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:54,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662967276] [2025-03-03 16:12:54,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:54,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:54,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:54,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:54,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:54,263 INFO L87 Difference]: Start difference. First operand 1726 states and 2789 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,320 INFO L93 Difference]: Finished difference Result 1734 states and 2798 transitions. [2025-03-03 16:12:54,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:54,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-03 16:12:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,327 INFO L225 Difference]: With dead ends: 1734 [2025-03-03 16:12:54,327 INFO L226 Difference]: Without dead ends: 1732 [2025-03-03 16:12:54,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:54,329 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 0 mSDsluCounter, 9323 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10879 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10879 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-03 16:12:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1732. [2025-03-03 16:12:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1730 states have (on average 1.615028901734104) internal successors, (2794), 1731 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2794 transitions. [2025-03-03 16:12:54,400 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2794 transitions. Word has length 68 [2025-03-03 16:12:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,400 INFO L471 AbstractCegarLoop]: Abstraction has 1732 states and 2794 transitions. [2025-03-03 16:12:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2794 transitions. [2025-03-03 16:12:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:54,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,402 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] [2025-03-03 16:12:54,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:12:54,402 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash -38470604, now seen corresponding path program 1 times [2025-03-03 16:12:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645866213] [2025-03-03 16:12:54,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:54,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:54,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:54,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:54,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645866213] [2025-03-03 16:12:54,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645866213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:54,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:54,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:54,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318600099] [2025-03-03 16:12:54,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:54,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:54,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:54,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:54,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,486 INFO L87 Difference]: Start difference. First operand 1732 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,511 INFO L93 Difference]: Finished difference Result 1926 states and 3095 transitions. [2025-03-03 16:12:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:54,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,516 INFO L225 Difference]: With dead ends: 1926 [2025-03-03 16:12:54,516 INFO L226 Difference]: Without dead ends: 1826 [2025-03-03 16:12:54,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,518 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1506 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2025-03-03 16:12:54,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1824. [2025-03-03 16:12:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1824 states, 1822 states have (on average 1.610867178924259) internal successors, (2935), 1823 states have internal predecessors, (2935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1824 states to 1824 states and 2935 transitions. [2025-03-03 16:12:54,548 INFO L78 Accepts]: Start accepts. Automaton has 1824 states and 2935 transitions. Word has length 69 [2025-03-03 16:12:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 1824 states and 2935 transitions. [2025-03-03 16:12:54,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1824 states and 2935 transitions. [2025-03-03 16:12:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:54,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,550 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] [2025-03-03 16:12:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:12:54,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -192839436, now seen corresponding path program 1 times [2025-03-03 16:12:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264938684] [2025-03-03 16:12:54,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:54,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:54,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:54,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:54,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264938684] [2025-03-03 16:12:54,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264938684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:54,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:54,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238049642] [2025-03-03 16:12:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:54,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:54,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,598 INFO L87 Difference]: Start difference. First operand 1824 states and 2935 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,631 INFO L93 Difference]: Finished difference Result 2342 states and 3735 transitions. [2025-03-03 16:12:54,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:54,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,637 INFO L225 Difference]: With dead ends: 2342 [2025-03-03 16:12:54,637 INFO L226 Difference]: Without dead ends: 2071 [2025-03-03 16:12:54,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,638 INFO L435 NwaCegarLoop]: 1626 mSDtfsCounter, 1504 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1708 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2025-03-03 16:12:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 2069. [2025-03-03 16:12:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 2067 states have (on average 1.5999032414126755) internal successors, (3307), 2068 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3307 transitions. [2025-03-03 16:12:54,674 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3307 transitions. Word has length 69 [2025-03-03 16:12:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,675 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3307 transitions. [2025-03-03 16:12:54,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3307 transitions. [2025-03-03 16:12:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:54,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,677 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] [2025-03-03 16:12:54,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:12:54,677 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1171769932, now seen corresponding path program 1 times [2025-03-03 16:12:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684375573] [2025-03-03 16:12:54,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:54,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:54,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684375573] [2025-03-03 16:12:54,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684375573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:54,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014516892] [2025-03-03 16:12:54,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:54,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:54,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,727 INFO L87 Difference]: Start difference. First operand 2069 states and 3307 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,759 INFO L93 Difference]: Finished difference Result 3053 states and 4809 transitions. [2025-03-03 16:12:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,766 INFO L225 Difference]: With dead ends: 3053 [2025-03-03 16:12:54,767 INFO L226 Difference]: Without dead ends: 2537 [2025-03-03 16:12:54,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,771 INFO L435 NwaCegarLoop]: 1624 mSDtfsCounter, 1502 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1502 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1502 Valid, 1710 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2025-03-03 16:12:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2535. [2025-03-03 16:12:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2535 states, 2533 states have (on average 1.5803395183576787) internal successors, (4003), 2534 states have internal predecessors, (4003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2535 states to 2535 states and 4003 transitions. [2025-03-03 16:12:54,818 INFO L78 Accepts]: Start accepts. Automaton has 2535 states and 4003 transitions. Word has length 69 [2025-03-03 16:12:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 2535 states and 4003 transitions. [2025-03-03 16:12:54,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2535 states and 4003 transitions. [2025-03-03 16:12:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:54,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,820 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] [2025-03-03 16:12:54,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:12:54,820 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1619715468, now seen corresponding path program 1 times [2025-03-03 16:12:54,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973494625] [2025-03-03 16:12:54,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:54,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:54,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:54,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973494625] [2025-03-03 16:12:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973494625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:54,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345927054] [2025-03-03 16:12:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:54,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:54,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:54,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,865 INFO L87 Difference]: Start difference. First operand 2535 states and 4003 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:54,902 INFO L93 Difference]: Finished difference Result 4403 states and 6813 transitions. [2025-03-03 16:12:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:54,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:54,911 INFO L225 Difference]: With dead ends: 4403 [2025-03-03 16:12:54,911 INFO L226 Difference]: Without dead ends: 3421 [2025-03-03 16:12:54,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:54,913 INFO L435 NwaCegarLoop]: 1622 mSDtfsCounter, 1500 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:54,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 1712 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:54,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-03-03 16:12:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3419. [2025-03-03 16:12:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3417 states have (on average 1.5507755340942346) internal successors, (5299), 3418 states have internal predecessors, (5299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5299 transitions. [2025-03-03 16:12:54,973 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5299 transitions. Word has length 69 [2025-03-03 16:12:54,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:54,974 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5299 transitions. [2025-03-03 16:12:54,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5299 transitions. [2025-03-03 16:12:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:54,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:54,975 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] [2025-03-03 16:12:54,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:12:54,975 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1204539596, now seen corresponding path program 1 times [2025-03-03 16:12:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:54,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125084823] [2025-03-03 16:12:54,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:54,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:54,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:54,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:54,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:55,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125084823] [2025-03-03 16:12:55,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125084823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:55,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:55,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:55,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678072103] [2025-03-03 16:12:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:55,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:55,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:55,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:55,019 INFO L87 Difference]: Start difference. First operand 3419 states and 5299 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:55,075 INFO L93 Difference]: Finished difference Result 6959 states and 10533 transitions. [2025-03-03 16:12:55,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:55,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:55,089 INFO L225 Difference]: With dead ends: 6959 [2025-03-03 16:12:55,089 INFO L226 Difference]: Without dead ends: 5093 [2025-03-03 16:12:55,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:55,092 INFO L435 NwaCegarLoop]: 1620 mSDtfsCounter, 1498 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:55,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1714 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:55,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2025-03-03 16:12:55,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 5091. [2025-03-03 16:12:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5091 states, 5089 states have (on average 1.5128708980153271) internal successors, (7699), 5090 states have internal predecessors, (7699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5091 states to 5091 states and 7699 transitions. [2025-03-03 16:12:55,256 INFO L78 Accepts]: Start accepts. Automaton has 5091 states and 7699 transitions. Word has length 69 [2025-03-03 16:12:55,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:55,256 INFO L471 AbstractCegarLoop]: Abstraction has 5091 states and 7699 transitions. [2025-03-03 16:12:55,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 5091 states and 7699 transitions. [2025-03-03 16:12:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 16:12:55,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:55,257 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] [2025-03-03 16:12:55,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:12:55,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:55,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1691257868, now seen corresponding path program 1 times [2025-03-03 16:12:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:55,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522740514] [2025-03-03 16:12:55,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:55,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:55,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 16:12:55,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 16:12:55,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:55,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:12:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522740514] [2025-03-03 16:12:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522740514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:55,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:12:55,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679847446] [2025-03-03 16:12:55,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:55,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:12:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:12:55,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:55,300 INFO L87 Difference]: Start difference. First operand 5091 states and 7699 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:55,387 INFO L93 Difference]: Finished difference Result 11783 states and 17397 transitions. [2025-03-03 16:12:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:12:55,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 16:12:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:55,411 INFO L225 Difference]: With dead ends: 11783 [2025-03-03 16:12:55,411 INFO L226 Difference]: Without dead ends: 8245 [2025-03-03 16:12:55,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:12:55,418 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1496 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:55,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1496 Valid, 1716 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:12:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8245 states. [2025-03-03 16:12:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8245 to 8243. [2025-03-03 16:12:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 8241 states have (on average 1.4700885814828297) internal successors, (12115), 8242 states have internal predecessors, (12115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 12115 transitions. [2025-03-03 16:12:55,595 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 12115 transitions. Word has length 69 [2025-03-03 16:12:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:55,595 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 12115 transitions. [2025-03-03 16:12:55,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:55,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 12115 transitions. [2025-03-03 16:12:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:55,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:55,598 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:55,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:12:55,599 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:55,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:55,599 INFO L85 PathProgramCache]: Analyzing trace with hash 704030, now seen corresponding path program 1 times [2025-03-03 16:12:55,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:55,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334712313] [2025-03-03 16:12:55,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:55,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:55,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:55,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:55,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:12:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334712313] [2025-03-03 16:12:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334712313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716332008] [2025-03-03 16:12:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:55,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:55,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:55,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:55,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:55,756 INFO L87 Difference]: Start difference. First operand 8243 states and 12115 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:56,519 INFO L93 Difference]: Finished difference Result 47841 states and 68890 transitions. [2025-03-03 16:12:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:56,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:12:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:56,594 INFO L225 Difference]: With dead ends: 47841 [2025-03-03 16:12:56,594 INFO L226 Difference]: Without dead ends: 43103 [2025-03-03 16:12:56,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:56,615 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8022 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8022 SdHoareTripleChecker+Valid, 4153 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:56,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8022 Valid, 4153 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43103 states. [2025-03-03 16:12:57,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43103 to 13971. [2025-03-03 16:12:57,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13971 states, 13969 states have (on average 1.4491373756174386) internal successors, (20243), 13970 states have internal predecessors, (20243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13971 states to 13971 states and 20243 transitions. [2025-03-03 16:12:57,120 INFO L78 Accepts]: Start accepts. Automaton has 13971 states and 20243 transitions. Word has length 90 [2025-03-03 16:12:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 13971 states and 20243 transitions. [2025-03-03 16:12:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13971 states and 20243 transitions. [2025-03-03 16:12:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:57,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:57,124 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:57,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:12:57,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:57,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash -153664802, now seen corresponding path program 1 times [2025-03-03 16:12:57,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:57,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156061822] [2025-03-03 16:12:57,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:57,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:57,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:57,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:57,263 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:12:57,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156061822] [2025-03-03 16:12:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156061822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:57,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903438046] [2025-03-03 16:12:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:57,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:57,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:57,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:57,264 INFO L87 Difference]: Start difference. First operand 13971 states and 20243 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:57,909 INFO L93 Difference]: Finished difference Result 54529 states and 78426 transitions. [2025-03-03 16:12:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:57,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:12:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:57,994 INFO L225 Difference]: With dead ends: 54529 [2025-03-03 16:12:57,994 INFO L226 Difference]: Without dead ends: 47839 [2025-03-03 16:12:58,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:58,017 INFO L435 NwaCegarLoop]: 1637 mSDtfsCounter, 8024 mSDsluCounter, 2479 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8024 SdHoareTripleChecker+Valid, 4116 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:58,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8024 Valid, 4116 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:12:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47839 states. [2025-03-03 16:12:58,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47839 to 23027. [2025-03-03 16:12:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23027 states, 23025 states have (on average 1.4364820846905537) internal successors, (33075), 23026 states have internal predecessors, (33075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23027 states to 23027 states and 33075 transitions. [2025-03-03 16:12:58,660 INFO L78 Accepts]: Start accepts. Automaton has 23027 states and 33075 transitions. Word has length 90 [2025-03-03 16:12:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:12:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 23027 states and 33075 transitions. [2025-03-03 16:12:58,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23027 states and 33075 transitions. [2025-03-03 16:12:58,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:12:58,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:12:58,664 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:12:58,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:12:58,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:12:58,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:12:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1132595298, now seen corresponding path program 1 times [2025-03-03 16:12:58,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:12:58,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643481434] [2025-03-03 16:12:58,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:12:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:12:58,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:12:58,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:12:58,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:12:58,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:12:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:12:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:12:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643481434] [2025-03-03 16:12:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643481434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:12:58,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:12:58,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:12:58,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686900218] [2025-03-03 16:12:58,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:12:58,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:12:58,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:12:58,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:12:58,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:12:58,805 INFO L87 Difference]: Start difference. First operand 23027 states and 33075 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:12:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:12:59,880 INFO L93 Difference]: Finished difference Result 61217 states and 87930 transitions. [2025-03-03 16:12:59,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:12:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 16:12:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:12:59,964 INFO L225 Difference]: With dead ends: 61217 [2025-03-03 16:12:59,964 INFO L226 Difference]: Without dead ends: 54527 [2025-03-03 16:12:59,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:12:59,989 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8044 mSDsluCounter, 2455 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8044 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:12:59,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8044 Valid, 4090 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54527 states. [2025-03-03 16:13:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54527 to 29715. [2025-03-03 16:13:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29715 states, 29713 states have (on average 1.4330091205869484) internal successors, (42579), 29714 states have internal predecessors, (42579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29715 states to 29715 states and 42579 transitions. [2025-03-03 16:13:00,944 INFO L78 Accepts]: Start accepts. Automaton has 29715 states and 42579 transitions. Word has length 90 [2025-03-03 16:13:00,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:00,944 INFO L471 AbstractCegarLoop]: Abstraction has 29715 states and 42579 transitions. [2025-03-03 16:13:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29715 states and 42579 transitions. [2025-03-03 16:13:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:00,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:00,948 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:13:00,948 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1580540834, now seen corresponding path program 1 times [2025-03-03 16:13:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361593876] [2025-03-03 16:13:00,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:00,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:00,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:00,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:00,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:13:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361593876] [2025-03-03 16:13:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361593876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535807475] [2025-03-03 16:13:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:01,076 INFO L87 Difference]: Start difference. First operand 29715 states and 42579 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-03 16:13:02,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:02,002 INFO L93 Difference]: Finished difference Result 67905 states and 97434 transitions. [2025-03-03 16:13:02,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:02,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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 90 [2025-03-03 16:13:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:02,090 INFO L225 Difference]: With dead ends: 67905 [2025-03-03 16:13:02,090 INFO L226 Difference]: Without dead ends: 61215 [2025-03-03 16:13:02,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:02,109 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8082 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8082 SdHoareTripleChecker+Valid, 4055 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:02,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8082 Valid, 4055 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61215 states. [2025-03-03 16:13:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61215 to 36403. [2025-03-03 16:13:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36403 states, 36401 states have (on average 1.4308123403203208) internal successors, (52083), 36402 states have internal predecessors, (52083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36403 states to 36403 states and 52083 transitions. [2025-03-03 16:13:03,026 INFO L78 Accepts]: Start accepts. Automaton has 36403 states and 52083 transitions. Word has length 90 [2025-03-03 16:13:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:03,026 INFO L471 AbstractCegarLoop]: Abstraction has 36403 states and 52083 transitions. [2025-03-03 16:13:03,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 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-03 16:13:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 36403 states and 52083 transitions. [2025-03-03 16:13:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:03,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:03,030 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:03,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:13:03,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:03,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1165364962, now seen corresponding path program 1 times [2025-03-03 16:13:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037912227] [2025-03-03 16:13:03,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:03,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:03,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:03,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 16:13:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037912227] [2025-03-03 16:13:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037912227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314911320] [2025-03-03 16:13:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:03,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:03,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:03,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:03,165 INFO L87 Difference]: Start difference. First operand 36403 states and 52083 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-03 16:13:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:04,442 INFO L93 Difference]: Finished difference Result 74593 states and 106938 transitions. [2025-03-03 16:13:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:04,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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 90 [2025-03-03 16:13:04,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:04,521 INFO L225 Difference]: With dead ends: 74593 [2025-03-03 16:13:04,521 INFO L226 Difference]: Without dead ends: 67903 [2025-03-03 16:13:04,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:04,539 INFO L435 NwaCegarLoop]: 1631 mSDtfsCounter, 8129 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8129 SdHoareTripleChecker+Valid, 4063 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:04,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8129 Valid, 4063 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:04,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67903 states. [2025-03-03 16:13:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67903 to 43091. [2025-03-03 16:13:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43091 states, 43089 states have (on average 1.429297500522175) internal successors, (61587), 43090 states have internal predecessors, (61587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:06,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43091 states to 43091 states and 61587 transitions. [2025-03-03 16:13:06,135 INFO L78 Accepts]: Start accepts. Automaton has 43091 states and 61587 transitions. Word has length 90 [2025-03-03 16:13:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:06,135 INFO L471 AbstractCegarLoop]: Abstraction has 43091 states and 61587 transitions. [2025-03-03 16:13:06,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 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-03 16:13:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 43091 states and 61587 transitions. [2025-03-03 16:13:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 16:13:06,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:06,140 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:06,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:13:06,140 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:06,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1652083234, now seen corresponding path program 1 times [2025-03-03 16:13:06,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:06,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735694308] [2025-03-03 16:13:06,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:06,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:06,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 16:13:06,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 16:13:06,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:06,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 16:13:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735694308] [2025-03-03 16:13:06,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735694308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:06,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:06,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 16:13:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889682273] [2025-03-03 16:13:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:06,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 16:13:06,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:06,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 16:13:06,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:13:06,258 INFO L87 Difference]: Start difference. First operand 43091 states and 61587 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 16:13:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:07,449 INFO L93 Difference]: Finished difference Result 81281 states and 116442 transitions. [2025-03-03 16:13:07,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 16:13:07,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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 90 [2025-03-03 16:13:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:07,552 INFO L225 Difference]: With dead ends: 81281 [2025-03-03 16:13:07,552 INFO L226 Difference]: Without dead ends: 74591 [2025-03-03 16:13:07,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-03 16:13:07,582 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8048 mSDsluCounter, 2498 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8048 SdHoareTripleChecker+Valid, 4128 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:07,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8048 Valid, 4128 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:13:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74591 states. [2025-03-03 16:13:08,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74591 to 49779. [2025-03-03 16:13:09,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4281897261787573) internal successors, (71091), 49778 states have internal predecessors, (71091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:09,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 71091 transitions. [2025-03-03 16:13:09,092 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 71091 transitions. Word has length 90 [2025-03-03 16:13:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 71091 transitions. [2025-03-03 16:13:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-03 16:13:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 71091 transitions. [2025-03-03 16:13:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 16:13:09,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:09,097 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:09,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:13:09,098 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:09,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:09,098 INFO L85 PathProgramCache]: Analyzing trace with hash 112504176, now seen corresponding path program 1 times [2025-03-03 16:13:09,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:09,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271710589] [2025-03-03 16:13:09,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:09,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:09,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 16:13:09,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 16:13:09,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:09,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:09,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:09,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271710589] [2025-03-03 16:13:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271710589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:09,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86962705] [2025-03-03 16:13:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:09,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:09,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:09,193 INFO L87 Difference]: Start difference. First operand 49779 states and 71091 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2025-03-03 16:13:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:10,434 INFO L93 Difference]: Finished difference Result 98007 states and 139669 transitions. [2025-03-03 16:13:10,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) Word has length 91 [2025-03-03 16:13:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:10,501 INFO L225 Difference]: With dead ends: 98007 [2025-03-03 16:13:10,501 INFO L226 Difference]: Without dead ends: 49781 [2025-03-03 16:13:10,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:10,545 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 53 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:10,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3154 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49781 states. [2025-03-03 16:13:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49781 to 49779. [2025-03-03 16:13:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49779 states, 49777 states have (on average 1.4143680816441329) internal successors, (70403), 49778 states have internal predecessors, (70403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49779 states to 49779 states and 70403 transitions. [2025-03-03 16:13:11,987 INFO L78 Accepts]: Start accepts. Automaton has 49779 states and 70403 transitions. Word has length 91 [2025-03-03 16:13:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:11,988 INFO L471 AbstractCegarLoop]: Abstraction has 49779 states and 70403 transitions. [2025-03-03 16:13:11,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 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) [2025-03-03 16:13:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 49779 states and 70403 transitions. [2025-03-03 16:13:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 16:13:11,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:11,991 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] [2025-03-03 16:13:11,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 16:13:11,991 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:11,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:11,991 INFO L85 PathProgramCache]: Analyzing trace with hash -490310180, now seen corresponding path program 1 times [2025-03-03 16:13:11,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:11,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438967726] [2025-03-03 16:13:11,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:11,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:12,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 16:13:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 16:13:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:12,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:12,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438967726] [2025-03-03 16:13:12,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438967726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:12,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:12,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:12,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297741187] [2025-03-03 16:13:12,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:12,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:12,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:12,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:12,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:12,063 INFO L87 Difference]: Start difference. First operand 49779 states and 70403 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:12,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:12,397 INFO L93 Difference]: Finished difference Result 67564 states and 95627 transitions. [2025-03-03 16:13:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:12,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-03 16:13:12,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:12,420 INFO L225 Difference]: With dead ends: 67564 [2025-03-03 16:13:12,420 INFO L226 Difference]: Without dead ends: 19338 [2025-03-03 16:13:12,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:12,449 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 47 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3151 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:12,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3151 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19338 states. [2025-03-03 16:13:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19338 to 19330. [2025-03-03 16:13:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19330 states, 19328 states have (on average 1.4222889072847682) internal successors, (27490), 19329 states have internal predecessors, (27490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19330 states to 19330 states and 27490 transitions. [2025-03-03 16:13:12,800 INFO L78 Accepts]: Start accepts. Automaton has 19330 states and 27490 transitions. Word has length 92 [2025-03-03 16:13:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:12,800 INFO L471 AbstractCegarLoop]: Abstraction has 19330 states and 27490 transitions. [2025-03-03 16:13:12,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 19330 states and 27490 transitions. [2025-03-03 16:13:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 16:13:12,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:12,802 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:12,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 16:13:12,802 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:12,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash -818182665, now seen corresponding path program 1 times [2025-03-03 16:13:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:12,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332656999] [2025-03-03 16:13:12,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:12,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:12,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 16:13:12,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 16:13:12,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:12,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:12,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:12,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332656999] [2025-03-03 16:13:12,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332656999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876763745] [2025-03-03 16:13:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:12,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:12,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:12,864 INFO L87 Difference]: Start difference. First operand 19330 states and 27490 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:13,016 INFO L93 Difference]: Finished difference Result 28214 states and 39972 transitions. [2025-03-03 16:13:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-03-03 16:13:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:13,028 INFO L225 Difference]: With dead ends: 28214 [2025-03-03 16:13:13,029 INFO L226 Difference]: Without dead ends: 10452 [2025-03-03 16:13:13,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:13,040 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 49 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 3130 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:13,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 3130 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:13,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10452 states. [2025-03-03 16:13:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10452 to 10450. [2025-03-03 16:13:13,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10450 states, 10448 states have (on average 1.4251531393568146) internal successors, (14890), 10449 states have internal predecessors, (14890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10450 states to 10450 states and 14890 transitions. [2025-03-03 16:13:13,398 INFO L78 Accepts]: Start accepts. Automaton has 10450 states and 14890 transitions. Word has length 93 [2025-03-03 16:13:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:13,398 INFO L471 AbstractCegarLoop]: Abstraction has 10450 states and 14890 transitions. [2025-03-03 16:13:13,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10450 states and 14890 transitions. [2025-03-03 16:13:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:13:13,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:13,400 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:13:13,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 16:13:13,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash -85389410, now seen corresponding path program 1 times [2025-03-03 16:13:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230684219] [2025-03-03 16:13:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:13,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:13,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:13:13,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:13:13,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:13,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230684219] [2025-03-03 16:13:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230684219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704348864] [2025-03-03 16:13:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:13,460 INFO L87 Difference]: Start difference. First operand 10450 states and 14890 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03 16:13:13,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:13,547 INFO L93 Difference]: Finished difference Result 14894 states and 21072 transitions. [2025-03-03 16:13:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-03 16:13:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:13,556 INFO L225 Difference]: With dead ends: 14894 [2025-03-03 16:13:13,556 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 16:13:13,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:13,563 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 46 mSDsluCounter, 1526 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:13,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 3115 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 16:13:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 6010. [2025-03-03 16:13:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6010 states, 6008 states have (on average 1.4397470039946738) internal successors, (8650), 6009 states have internal predecessors, (8650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6010 states to 6010 states and 8650 transitions. [2025-03-03 16:13:13,665 INFO L78 Accepts]: Start accepts. Automaton has 6010 states and 8650 transitions. Word has length 95 [2025-03-03 16:13:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 6010 states and 8650 transitions. [2025-03-03 16:13:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03 16:13:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6010 states and 8650 transitions. [2025-03-03 16:13:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 16:13:13,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:13,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 16:13:13,667 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash 395467708, now seen corresponding path program 1 times [2025-03-03 16:13:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:13,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881255554] [2025-03-03 16:13:13,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:13:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:13:13,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:13,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:13,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:13,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881255554] [2025-03-03 16:13:13,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881255554] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:13,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107165595] [2025-03-03 16:13:13,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:13,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:13,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:13,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:13:13,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 16:13:13,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 16:13:13,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:13,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:13,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 16:13:13,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:13,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 16:13:13,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107165595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:13,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 16:13:13,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 16:13:13,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890918898] [2025-03-03 16:13:13,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:13,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:13,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:13,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:13,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:13:13,894 INFO L87 Difference]: Start difference. First operand 6010 states and 8650 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03 16:13:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:16,369 INFO L93 Difference]: Finished difference Result 9016 states and 13577 transitions. [2025-03-03 16:13:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:16,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-03-03 16:13:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:16,378 INFO L225 Difference]: With dead ends: 9016 [2025-03-03 16:13:16,378 INFO L226 Difference]: Without dead ends: 7512 [2025-03-03 16:13:16,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:13:16,380 INFO L435 NwaCegarLoop]: 1272 mSDtfsCounter, 745 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:16,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1403 Invalid, 3093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 16:13:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7512 states. [2025-03-03 16:13:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7512 to 7512. [2025-03-03 16:13:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7512 states, 7510 states have (on average 1.4388814913448735) internal successors, (10806), 7511 states have internal predecessors, (10806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7512 states to 7512 states and 10806 transitions. [2025-03-03 16:13:16,542 INFO L78 Accepts]: Start accepts. Automaton has 7512 states and 10806 transitions. Word has length 95 [2025-03-03 16:13:16,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:16,543 INFO L471 AbstractCegarLoop]: Abstraction has 7512 states and 10806 transitions. [2025-03-03 16:13:16,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-03 16:13:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 7512 states and 10806 transitions. [2025-03-03 16:13:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 16:13:16,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:16,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:16,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:13:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:13:16,745 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1915372955, now seen corresponding path program 1 times [2025-03-03 16:13:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161309831] [2025-03-03 16:13:16,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:16,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 16:13:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 16:13:16,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:16,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:16,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161309831] [2025-03-03 16:13:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161309831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:16,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:16,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:16,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928540183] [2025-03-03 16:13:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:16,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:16,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:16,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:16,828 INFO L87 Difference]: Start difference. First operand 7512 states and 10806 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:16,905 INFO L93 Difference]: Finished difference Result 9736 states and 13868 transitions. [2025-03-03 16:13:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 16:13:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:16,911 INFO L225 Difference]: With dead ends: 9736 [2025-03-03 16:13:16,911 INFO L226 Difference]: Without dead ends: 5294 [2025-03-03 16:13:16,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:16,914 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 43 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:16,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 3100 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2025-03-03 16:13:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 5292. [2025-03-03 16:13:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5290 states have (on average 1.458601134215501) internal successors, (7716), 5291 states have internal predecessors, (7716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 7716 transitions. [2025-03-03 16:13:17,013 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 7716 transitions. Word has length 97 [2025-03-03 16:13:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:17,013 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 7716 transitions. [2025-03-03 16:13:17,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 7716 transitions. [2025-03-03 16:13:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 16:13:17,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:17,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:17,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 16:13:17,014 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:17,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:17,014 INFO L85 PathProgramCache]: Analyzing trace with hash 952828632, now seen corresponding path program 1 times [2025-03-03 16:13:17,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:17,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625868895] [2025-03-03 16:13:17,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:17,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:17,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 16:13:17,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 16:13:17,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:17,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:17,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:17,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625868895] [2025-03-03 16:13:17,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625868895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:17,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:17,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:13:17,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505462907] [2025-03-03 16:13:17,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:17,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:17,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:17,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:17,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:17,069 INFO L87 Difference]: Start difference. First operand 5292 states and 7716 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:19,232 INFO L93 Difference]: Finished difference Result 11302 states and 16955 transitions. [2025-03-03 16:13:19,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:19,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-03 16:13:19,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:19,242 INFO L225 Difference]: With dead ends: 11302 [2025-03-03 16:13:19,242 INFO L226 Difference]: Without dead ends: 8296 [2025-03-03 16:13:19,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:19,245 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 897 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 935 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 2930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:19,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 570 Invalid, 2930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 16:13:19,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8296 states. [2025-03-03 16:13:19,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8296 to 8296. [2025-03-03 16:13:19,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8296 states, 8294 states have (on average 1.367856281649385) internal successors, (11345), 8295 states have internal predecessors, (11345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8296 states to 8296 states and 11345 transitions. [2025-03-03 16:13:19,368 INFO L78 Accepts]: Start accepts. Automaton has 8296 states and 11345 transitions. Word has length 98 [2025-03-03 16:13:19,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:19,368 INFO L471 AbstractCegarLoop]: Abstraction has 8296 states and 11345 transitions. [2025-03-03 16:13:19,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,368 INFO L276 IsEmpty]: Start isEmpty. Operand 8296 states and 11345 transitions. [2025-03-03 16:13:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 16:13:19,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:19,369 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:19,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 16:13:19,369 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:19,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1704200628, now seen corresponding path program 1 times [2025-03-03 16:13:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095209639] [2025-03-03 16:13:19,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:19,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 16:13:19,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 16:13:19,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:19,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:19,443 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:19,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:19,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095209639] [2025-03-03 16:13:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095209639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:13:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:13:19,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:13:19,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563981248] [2025-03-03 16:13:19,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:13:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:13:19,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:19,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:13:19,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:19,445 INFO L87 Difference]: Start difference. First operand 8296 states and 11345 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-03 16:13:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:19,502 INFO L93 Difference]: Finished difference Result 9410 states and 12862 transitions. [2025-03-03 16:13:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:13:19,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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 99 [2025-03-03 16:13:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:19,509 INFO L225 Difference]: With dead ends: 9410 [2025-03-03 16:13:19,509 INFO L226 Difference]: Without dead ends: 7188 [2025-03-03 16:13:19,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:13:19,512 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 40 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:19,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3085 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:13:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7188 states. [2025-03-03 16:13:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7188 to 7186. [2025-03-03 16:13:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7184 states have (on average 1.3662305122494431) internal successors, (9815), 7185 states have internal predecessors, (9815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 9815 transitions. [2025-03-03 16:13:19,610 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 9815 transitions. Word has length 99 [2025-03-03 16:13:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:19,610 INFO L471 AbstractCegarLoop]: Abstraction has 7186 states and 9815 transitions. [2025-03-03 16:13:19,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 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-03 16:13:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 9815 transitions. [2025-03-03 16:13:19,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 16:13:19,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:19,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:19,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 16:13:19,612 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:19,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -932695213, now seen corresponding path program 1 times [2025-03-03 16:13:19,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:19,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250119548] [2025-03-03 16:13:19,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:19,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:13:19,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:13:19,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:19,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:19,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250119548] [2025-03-03 16:13:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250119548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126963006] [2025-03-03 16:13:19,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:19,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:19,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:19,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:13:19,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 16:13:20,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 16:13:20,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:20,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:20,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:13:20,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:20,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:13:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:20,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126963006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:13:20,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:13:20,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 19 [2025-03-03 16:13:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355895419] [2025-03-03 16:13:20,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:13:20,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 16:13:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:20,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 16:13:20,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-03-03 16:13:20,788 INFO L87 Difference]: Start difference. First operand 7186 states and 9815 transitions. Second operand has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:22,613 INFO L93 Difference]: Finished difference Result 14892 states and 19982 transitions. [2025-03-03 16:13:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 16:13:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 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-03 16:13:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:22,631 INFO L225 Difference]: With dead ends: 14892 [2025-03-03 16:13:22,631 INFO L226 Difference]: Without dead ends: 13690 [2025-03-03 16:13:22,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=781, Invalid=3251, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 16:13:22,637 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 13432 mSDsluCounter, 8113 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13432 SdHoareTripleChecker+Valid, 9683 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:22,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13432 Valid, 9683 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 16:13:22,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13690 states. [2025-03-03 16:13:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13690 to 12998. [2025-03-03 16:13:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12998 states, 12996 states have (on average 1.3358725761772854) internal successors, (17361), 12997 states have internal predecessors, (17361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12998 states to 12998 states and 17361 transitions. [2025-03-03 16:13:22,938 INFO L78 Accepts]: Start accepts. Automaton has 12998 states and 17361 transitions. Word has length 101 [2025-03-03 16:13:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:22,938 INFO L471 AbstractCegarLoop]: Abstraction has 12998 states and 17361 transitions. [2025-03-03 16:13:22,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12998 states and 17361 transitions. [2025-03-03 16:13:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 16:13:22,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:22,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:22,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 16:13:23,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 16:13:23,141 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:23,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:23,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1284037986, now seen corresponding path program 1 times [2025-03-03 16:13:23,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:23,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182272647] [2025-03-03 16:13:23,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:23,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:23,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:13:23,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:13:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:23,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182272647] [2025-03-03 16:13:23,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182272647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:23,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644983839] [2025-03-03 16:13:23,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:23,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:23,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:13:23,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 16:13:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 16:13:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:23,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:23,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:13:23,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:24,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:13:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:24,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644983839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:13:24,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:13:24,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 32 [2025-03-03 16:13:24,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412286752] [2025-03-03 16:13:24,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:13:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 16:13:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:24,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 16:13:24,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:13:24,912 INFO L87 Difference]: Start difference. First operand 12998 states and 17361 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:13:27,166 INFO L93 Difference]: Finished difference Result 41350 states and 54533 transitions. [2025-03-03 16:13:27,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 16:13:27,166 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 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 102 [2025-03-03 16:13:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:13:27,202 INFO L225 Difference]: With dead ends: 41350 [2025-03-03 16:13:27,202 INFO L226 Difference]: Without dead ends: 34483 [2025-03-03 16:13:27,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1209 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1014, Invalid=4242, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 16:13:27,216 INFO L435 NwaCegarLoop]: 1509 mSDtfsCounter, 22622 mSDsluCounter, 8078 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22622 SdHoareTripleChecker+Valid, 9587 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 16:13:27,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22622 Valid, 9587 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 16:13:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34483 states. [2025-03-03 16:13:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34483 to 34143. [2025-03-03 16:13:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34143 states, 34141 states have (on average 1.2941917342784335) internal successors, (44185), 34142 states have internal predecessors, (44185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:27,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34143 states to 34143 states and 44185 transitions. [2025-03-03 16:13:27,947 INFO L78 Accepts]: Start accepts. Automaton has 34143 states and 44185 transitions. Word has length 102 [2025-03-03 16:13:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:13:27,947 INFO L471 AbstractCegarLoop]: Abstraction has 34143 states and 44185 transitions. [2025-03-03 16:13:27,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:13:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 34143 states and 44185 transitions. [2025-03-03 16:13:27,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 16:13:27,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:13:27,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:13:27,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:13:28,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:28,149 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:13:28,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:13:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1836367294, now seen corresponding path program 1 times [2025-03-03 16:13:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:13:28,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117562459] [2025-03-03 16:13:28,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:13:28,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:13:28,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:13:28,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:28,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:28,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:13:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117562459] [2025-03-03 16:13:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117562459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:13:28,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797507604] [2025-03-03 16:13:28,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:13:28,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:13:28,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:13:28,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:13:28,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:13:28,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 16:13:28,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 16:13:28,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:13:28,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:13:28,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:13:28,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:13:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:29,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:13:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:13:29,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797507604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:13:29,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:13:29,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 27 [2025-03-03 16:13:29,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588122221] [2025-03-03 16:13:29,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:13:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 16:13:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:13:29,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 16:13:29,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-03-03 16:13:29,739 INFO L87 Difference]: Start difference. First operand 34143 states and 44185 transitions. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 27 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)