./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.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 7b106c16f890b4f1f31bdf98bba3b1882ec8a4b626832b9e3b2f13954dceb627 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:30:30,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:30:30,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:30:30,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:30:30,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:30:30,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:30:30,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:30:30,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:30:30,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:30:30,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:30:30,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:30:30,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:30:30,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:30:30,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:30:30,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:30,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:30:30,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:30:30,539 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 -> 7b106c16f890b4f1f31bdf98bba3b1882ec8a4b626832b9e3b2f13954dceb627 [2025-03-16 20:30:30,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:30:30,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:30:30,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:30:30,755 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:30:30,755 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:30:30,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:30:31,813 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a30f88a/7ba6de8ba64848d5add968f223c10fc1/FLAG4572c9af5 [2025-03-16 20:30:32,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:30:32,170 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:30:32,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a30f88a/7ba6de8ba64848d5add968f223c10fc1/FLAG4572c9af5 [2025-03-16 20:30:32,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a30f88a/7ba6de8ba64848d5add968f223c10fc1 [2025-03-16 20:30:32,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:30:32,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:30:32,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:32,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:30:32,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:30:32,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:32" (1/1) ... [2025-03-16 20:30:32,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5fcf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:32, skipping insertion in model container [2025-03-16 20:30:32,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:30:32" (1/1) ... [2025-03-16 20:30:32,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:30:32,816 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[15547,15560] [2025-03-16 20:30:32,863 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[21102,21115] [2025-03-16 20:30:33,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:33,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:30:33,303 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[15547,15560] [2025-03-16 20:30:33,310 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.1.ufo.UNBOUNDED.pals+Problem12_label01.c[21102,21115] [2025-03-16 20:30:33,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:30:33,564 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:30:33,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33 WrapperNode [2025-03-16 20:30:33,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:30:33,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:33,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:30:33,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:30:33,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,814 INFO L138 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5152 [2025-03-16 20:30:33,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:30:33,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:30:33,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:30:33,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:30:33,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,952 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:30:33,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:33,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:30:34,165 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:30:34,165 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:30:34,165 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:30:34,165 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (1/1) ... [2025-03-16 20:30:34,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:30:34,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:30:34,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:30:34,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:30:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:30:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:30:34,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:30:34,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:30:34,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:30:34,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:30:37,465 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3687: havoc calculate_output2_#t~ret42#1; [2025-03-16 20:30:37,466 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5177: havoc calculate_output3_#t~ret43#1; [2025-03-16 20:30:37,466 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2208: havoc calculate_output_#t~ret41#1; [2025-03-16 20:30:37,606 INFO L? ?]: Removed 745 outVars from TransFormulas that were not future-live. [2025-03-16 20:30:37,607 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:30:37,637 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:30:37,640 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:30:37,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:37 BoogieIcfgContainer [2025-03-16 20:30:37,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:30:37,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:30:37,642 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:30:37,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:30:37,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:30:32" (1/3) ... [2025-03-16 20:30:37,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab7f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:37, skipping insertion in model container [2025-03-16 20:30:37,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:30:33" (2/3) ... [2025-03-16 20:30:37,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab7f461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:30:37, skipping insertion in model container [2025-03-16 20:30:37,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:30:37" (3/3) ... [2025-03-16 20:30:37,648 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.c [2025-03-16 20:30:37,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:30:37,660 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals+Problem12_label01.c that has 1 procedures, 851 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:30:37,727 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:30:37,737 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;@2e6c666b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:30:37,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:30:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:37,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:37,747 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] [2025-03-16 20:30:37,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:37,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:37,750 INFO L85 PathProgramCache]: Analyzing trace with hash 382305243, now seen corresponding path program 1 times [2025-03-16 20:30:37,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:37,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986143389] [2025-03-16 20:30:37,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:37,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:37,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:37,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:37,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:37,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:37,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:37,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986143389] [2025-03-16 20:30:37,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986143389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:37,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:37,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:30:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966519391] [2025-03-16 20:30:37,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:37,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:30:37,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:37,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:30:37,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:30:37,965 INFO L87 Difference]: Start difference. First operand has 851 states, 848 states have (on average 1.9705188679245282) internal successors, (1671), 850 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:38,031 INFO L93 Difference]: Finished difference Result 1658 states and 3256 transitions. [2025-03-16 20:30:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:30:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:30:38,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:38,046 INFO L225 Difference]: With dead ends: 1658 [2025-03-16 20:30:38,046 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:38,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:30:38,053 INFO L435 NwaCegarLoop]: 1606 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:38,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:38,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:38,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8958579881656805) internal successors, (1602), 846 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1602 transitions. [2025-03-16 20:30:38,112 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1602 transitions. Word has length 23 [2025-03-16 20:30:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1602 transitions. [2025-03-16 20:30:38,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1602 transitions. [2025-03-16 20:30:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 20:30:38,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:38,114 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] [2025-03-16 20:30:38,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:30:38,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:38,114 INFO L85 PathProgramCache]: Analyzing trace with hash -462166628, now seen corresponding path program 1 times [2025-03-16 20:30:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479693039] [2025-03-16 20:30:38,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:38,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 20:30:38,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 20:30:38,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:38,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:38,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:38,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479693039] [2025-03-16 20:30:38,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479693039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:38,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:38,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:30:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158900872] [2025-03-16 20:30:38,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:38,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:30:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:38,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:30:38,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:38,331 INFO L87 Difference]: Start difference. First operand 847 states and 1602 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:38,427 INFO L93 Difference]: Finished difference Result 899 states and 1684 transitions. [2025-03-16 20:30:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:30:38,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-16 20:30:38,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:38,432 INFO L225 Difference]: With dead ends: 899 [2025-03-16 20:30:38,434 INFO L226 Difference]: Without dead ends: 847 [2025-03-16 20:30:38,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:38,435 INFO L435 NwaCegarLoop]: 1601 mSDtfsCounter, 0 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:38,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4759 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:38,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-03-16 20:30:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2025-03-16 20:30:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 845 states have (on average 1.8485207100591716) internal successors, (1562), 846 states have internal predecessors, (1562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1562 transitions. [2025-03-16 20:30:38,458 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1562 transitions. Word has length 23 [2025-03-16 20:30:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:38,458 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1562 transitions. [2025-03-16 20:30:38,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:38,459 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1562 transitions. [2025-03-16 20:30:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 20:30:38,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:38,460 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] [2025-03-16 20:30:38,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:30:38,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:38,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:38,461 INFO L85 PathProgramCache]: Analyzing trace with hash 975059731, now seen corresponding path program 1 times [2025-03-16 20:30:38,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:38,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803142606] [2025-03-16 20:30:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:38,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:38,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 20:30:38,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 20:30:38,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:38,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:38,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:38,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803142606] [2025-03-16 20:30:38,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803142606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:38,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:38,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:38,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068708728] [2025-03-16 20:30:38,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:38,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:30:38,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:38,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:30:38,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:30:38,619 INFO L87 Difference]: Start difference. First operand 847 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:43,081 INFO L93 Difference]: Finished difference Result 3102 states and 5871 transitions. [2025-03-16 20:30:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:30:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-16 20:30:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:43,093 INFO L225 Difference]: With dead ends: 3102 [2025-03-16 20:30:43,093 INFO L226 Difference]: Without dead ends: 2349 [2025-03-16 20:30:43,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:30:43,096 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 2464 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 6507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1153 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 816 Invalid, 6507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1153 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-16 20:30:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2025-03-16 20:30:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2349. [2025-03-16 20:30:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2347 states have (on average 1.566254793353217) internal successors, (3676), 2348 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3676 transitions. [2025-03-16 20:30:43,136 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3676 transitions. Word has length 47 [2025-03-16 20:30:43,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:43,137 INFO L471 AbstractCegarLoop]: Abstraction has 2349 states and 3676 transitions. [2025-03-16 20:30:43,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3676 transitions. [2025-03-16 20:30:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 20:30:43,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:43,139 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] [2025-03-16 20:30:43,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:30:43,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -858517098, now seen corresponding path program 1 times [2025-03-16 20:30:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:43,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265786737] [2025-03-16 20:30:43,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:43,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 20:30:43,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 20:30:43,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:43,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265786737] [2025-03-16 20:30:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265786737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168353855] [2025-03-16 20:30:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:43,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:43,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:43,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:43,315 INFO L87 Difference]: Start difference. First operand 2349 states and 3676 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:43,530 INFO L93 Difference]: Finished difference Result 2937 states and 4624 transitions. [2025-03-16 20:30:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:30:43,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-16 20:30:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:43,539 INFO L225 Difference]: With dead ends: 2937 [2025-03-16 20:30:43,540 INFO L226 Difference]: Without dead ends: 2888 [2025-03-16 20:30:43,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 20:30:43,542 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 9770 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9770 SdHoareTripleChecker+Valid, 3315 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:43,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9770 Valid, 3315 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:43,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2025-03-16 20:30:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2396. [2025-03-16 20:30:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.567251461988304) internal successors, (3752), 2395 states have internal predecessors, (3752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3752 transitions. [2025-03-16 20:30:43,583 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3752 transitions. Word has length 62 [2025-03-16 20:30:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3752 transitions. [2025-03-16 20:30:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3752 transitions. [2025-03-16 20:30:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:43,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:43,587 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] [2025-03-16 20:30:43,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:30:43,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:43,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash -364028136, now seen corresponding path program 1 times [2025-03-16 20:30:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484958885] [2025-03-16 20:30:43,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:43,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:43,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:43,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:43,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:43,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:43,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484958885] [2025-03-16 20:30:43,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484958885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:43,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:43,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:43,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23374915] [2025-03-16 20:30:43,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:43,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:43,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:43,881 INFO L87 Difference]: Start difference. First operand 2396 states and 3752 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,044 INFO L93 Difference]: Finished difference Result 2494 states and 3908 transitions. [2025-03-16 20:30:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:44,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:30:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,051 INFO L225 Difference]: With dead ends: 2494 [2025-03-16 20:30:44,051 INFO L226 Difference]: Without dead ends: 2398 [2025-03-16 20:30:44,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 20:30:44,052 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 3026 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 1941 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:44,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 1941 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-16 20:30:44,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2396. [2025-03-16 20:30:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2396 states, 2394 states have (on average 1.5668337510442774) internal successors, (3751), 2395 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2396 states to 2396 states and 3751 transitions. [2025-03-16 20:30:44,084 INFO L78 Accepts]: Start accepts. Automaton has 2396 states and 3751 transitions. Word has length 64 [2025-03-16 20:30:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,085 INFO L471 AbstractCegarLoop]: Abstraction has 2396 states and 3751 transitions. [2025-03-16 20:30:44,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 2396 states and 3751 transitions. [2025-03-16 20:30:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-16 20:30:44,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,086 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] [2025-03-16 20:30:44,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:30:44,087 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,088 INFO L85 PathProgramCache]: Analyzing trace with hash -365070821, now seen corresponding path program 1 times [2025-03-16 20:30:44,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080704664] [2025-03-16 20:30:44,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-16 20:30:44,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-16 20:30:44,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080704664] [2025-03-16 20:30:44,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080704664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983784298] [2025-03-16 20:30:44,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:44,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,173 INFO L87 Difference]: Start difference. First operand 2396 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,204 INFO L93 Difference]: Finished difference Result 2577 states and 4040 transitions. [2025-03-16 20:30:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-16 20:30:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,212 INFO L225 Difference]: With dead ends: 2577 [2025-03-16 20:30:44,213 INFO L226 Difference]: Without dead ends: 2481 [2025-03-16 20:30:44,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,214 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 1490 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:44,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1630 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-16 20:30:44,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2477. [2025-03-16 20:30:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2477 states, 2475 states have (on average 1.566868686868687) internal successors, (3878), 2476 states have internal predecessors, (3878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2477 states to 2477 states and 3878 transitions. [2025-03-16 20:30:44,253 INFO L78 Accepts]: Start accepts. Automaton has 2477 states and 3878 transitions. Word has length 64 [2025-03-16 20:30:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,254 INFO L471 AbstractCegarLoop]: Abstraction has 2477 states and 3878 transitions. [2025-03-16 20:30:44,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2477 states and 3878 transitions. [2025-03-16 20:30:44,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 20:30:44,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,254 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-16 20:30:44,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:30:44,255 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1601014732, now seen corresponding path program 1 times [2025-03-16 20:30:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611018365] [2025-03-16 20:30:44,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 20:30:44,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 20:30:44,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611018365] [2025-03-16 20:30:44,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611018365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:30:44,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016849171] [2025-03-16 20:30:44,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:30:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:30:44,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:44,459 INFO L87 Difference]: Start difference. First operand 2477 states and 3878 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-16 20:30:44,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,494 INFO L93 Difference]: Finished difference Result 2483 states and 3885 transitions. [2025-03-16 20:30:44,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:30:44,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-16 20:30:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,501 INFO L225 Difference]: With dead ends: 2483 [2025-03-16 20:30:44,501 INFO L226 Difference]: Without dead ends: 2481 [2025-03-16 20:30:44,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:30:44,502 INFO L435 NwaCegarLoop]: 1558 mSDtfsCounter, 0 mSDsluCounter, 6221 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7779 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:44,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7779 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-03-16 20:30:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2481. [2025-03-16 20:30:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2479 states have (on average 1.5655506252521179) internal successors, (3881), 2480 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3881 transitions. [2025-03-16 20:30:44,535 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3881 transitions. Word has length 65 [2025-03-16 20:30:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 3881 transitions. [2025-03-16 20:30:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 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-16 20:30:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3881 transitions. [2025-03-16 20:30:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:44,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,536 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] [2025-03-16 20:30:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:30:44,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1938748038, now seen corresponding path program 1 times [2025-03-16 20:30:44,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465283699] [2025-03-16 20:30:44,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:44,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:44,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465283699] [2025-03-16 20:30:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465283699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203985696] [2025-03-16 20:30:44,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:44,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:44,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,581 INFO L87 Difference]: Start difference. First operand 2481 states and 3881 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,603 INFO L93 Difference]: Finished difference Result 2827 states and 4421 transitions. [2025-03-16 20:30:44,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:44,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:30:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,609 INFO L225 Difference]: With dead ends: 2827 [2025-03-16 20:30:44,609 INFO L226 Difference]: Without dead ends: 2646 [2025-03-16 20:30:44,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,611 INFO L435 NwaCegarLoop]: 1618 mSDtfsCounter, 1505 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 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-16 20:30:44,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2646 states. [2025-03-16 20:30:44,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2644. [2025-03-16 20:30:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2642 states have (on average 1.5639666919000756) internal successors, (4132), 2643 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 4132 transitions. [2025-03-16 20:30:44,646 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 4132 transitions. Word has length 66 [2025-03-16 20:30:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,647 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 4132 transitions. [2025-03-16 20:30:44,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 4132 transitions. [2025-03-16 20:30:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:44,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,648 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] [2025-03-16 20:30:44,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:30:44,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1095389062, now seen corresponding path program 1 times [2025-03-16 20:30:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349886337] [2025-03-16 20:30:44,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:44,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:44,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349886337] [2025-03-16 20:30:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349886337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628545580] [2025-03-16 20:30:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:44,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,720 INFO L87 Difference]: Start difference. First operand 2644 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,746 INFO L93 Difference]: Finished difference Result 3300 states and 5146 transitions. [2025-03-16 20:30:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:44,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:30:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,754 INFO L225 Difference]: With dead ends: 3300 [2025-03-16 20:30:44,754 INFO L226 Difference]: Without dead ends: 2956 [2025-03-16 20:30:44,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,757 INFO L435 NwaCegarLoop]: 1616 mSDtfsCounter, 1503 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1503 SdHoareTripleChecker+Valid, 1704 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-16 20:30:44,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1503 Valid, 1704 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2025-03-16 20:30:44,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2954. [2025-03-16 20:30:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 2952 states have (on average 1.5589430894308942) internal successors, (4602), 2953 states have internal predecessors, (4602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 4602 transitions. [2025-03-16 20:30:44,795 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 4602 transitions. Word has length 66 [2025-03-16 20:30:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,795 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 4602 transitions. [2025-03-16 20:30:44,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 4602 transitions. [2025-03-16 20:30:44,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:44,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,796 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] [2025-03-16 20:30:44,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:30:44,796 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash -338348422, now seen corresponding path program 1 times [2025-03-16 20:30:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664725495] [2025-03-16 20:30:44,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:44,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:44,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664725495] [2025-03-16 20:30:44,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664725495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:44,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806452080] [2025-03-16 20:30:44,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:44,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:44,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,843 INFO L87 Difference]: Start difference. First operand 2954 states and 4602 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:44,872 INFO L93 Difference]: Finished difference Result 4198 states and 6500 transitions. [2025-03-16 20:30:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:30:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:44,885 INFO L225 Difference]: With dead ends: 4198 [2025-03-16 20:30:44,886 INFO L226 Difference]: Without dead ends: 3544 [2025-03-16 20:30:44,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,887 INFO L435 NwaCegarLoop]: 1604 mSDtfsCounter, 1499 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 1700 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-16 20:30:44,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 1700 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3544 states. [2025-03-16 20:30:44,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3544 to 3542. [2025-03-16 20:30:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3540 states have (on average 1.547457627118644) internal successors, (5478), 3541 states have internal predecessors, (5478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 5478 transitions. [2025-03-16 20:30:44,935 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 5478 transitions. Word has length 66 [2025-03-16 20:30:44,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:44,935 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 5478 transitions. [2025-03-16 20:30:44,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:44,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 5478 transitions. [2025-03-16 20:30:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:44,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:44,937 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] [2025-03-16 20:30:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:30:44,938 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:44,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -888137350, now seen corresponding path program 1 times [2025-03-16 20:30:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:44,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972497182] [2025-03-16 20:30:44,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:44,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:44,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:44,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:44,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:44,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972497182] [2025-03-16 20:30:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972497182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:44,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738720294] [2025-03-16 20:30:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:44,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:44,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:44,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:44,980 INFO L87 Difference]: Start difference. First operand 3542 states and 5478 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:45,029 INFO L93 Difference]: Finished difference Result 5898 states and 9016 transitions. [2025-03-16 20:30:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:30:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:45,039 INFO L225 Difference]: With dead ends: 5898 [2025-03-16 20:30:45,039 INFO L226 Difference]: Without dead ends: 4656 [2025-03-16 20:30:45,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:45,042 INFO L435 NwaCegarLoop]: 1602 mSDtfsCounter, 1497 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 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-16 20:30:45,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1702 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4656 states. [2025-03-16 20:30:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4656 to 4654. [2025-03-16 20:30:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4654 states, 4652 states have (on average 1.5266552020636286) internal successors, (7102), 4653 states have internal predecessors, (7102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4654 states to 4654 states and 7102 transitions. [2025-03-16 20:30:45,123 INFO L78 Accepts]: Start accepts. Automaton has 4654 states and 7102 transitions. Word has length 66 [2025-03-16 20:30:45,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:45,123 INFO L471 AbstractCegarLoop]: Abstraction has 4654 states and 7102 transitions. [2025-03-16 20:30:45,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4654 states and 7102 transitions. [2025-03-16 20:30:45,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-16 20:30:45,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:45,124 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] [2025-03-16 20:30:45,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:30:45,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:45,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:45,124 INFO L85 PathProgramCache]: Analyzing trace with hash -272166022, now seen corresponding path program 1 times [2025-03-16 20:30:45,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:45,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341954789] [2025-03-16 20:30:45,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:45,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-16 20:30:45,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-16 20:30:45,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:45,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:45,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341954789] [2025-03-16 20:30:45,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341954789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:45,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:45,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576778683] [2025-03-16 20:30:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:45,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:45,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:45,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:45,165 INFO L87 Difference]: Start difference. First operand 4654 states and 7102 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:45,229 INFO L93 Difference]: Finished difference Result 9106 states and 13664 transitions. [2025-03-16 20:30:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:45,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-16 20:30:45,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:45,239 INFO L225 Difference]: With dead ends: 9106 [2025-03-16 20:30:45,239 INFO L226 Difference]: Without dead ends: 6752 [2025-03-16 20:30:45,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:45,243 INFO L435 NwaCegarLoop]: 1614 mSDtfsCounter, 1501 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 1706 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-16 20:30:45,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 1706 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2025-03-16 20:30:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 6750. [2025-03-16 20:30:45,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6750 states, 6748 states have (on average 1.495850622406639) internal successors, (10094), 6749 states have internal predecessors, (10094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6750 states to 6750 states and 10094 transitions. [2025-03-16 20:30:45,416 INFO L78 Accepts]: Start accepts. Automaton has 6750 states and 10094 transitions. Word has length 66 [2025-03-16 20:30:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 6750 states and 10094 transitions. [2025-03-16 20:30:45,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6750 states and 10094 transitions. [2025-03-16 20:30:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-16 20:30:45,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:45,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:30:45,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:30:45,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1055373978, now seen corresponding path program 1 times [2025-03-16 20:30:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135126049] [2025-03-16 20:30:45,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:45,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-16 20:30:45,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-16 20:30:45,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:45,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:45,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135126049] [2025-03-16 20:30:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135126049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:45,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611975112] [2025-03-16 20:30:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:45,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:45,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:45,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:45,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:45,464 INFO L87 Difference]: Start difference. First operand 6750 states and 10094 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:30:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:45,539 INFO L93 Difference]: Finished difference Result 11365 states and 16948 transitions. [2025-03-16 20:30:45,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:45,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:30:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:45,553 INFO L225 Difference]: With dead ends: 11365 [2025-03-16 20:30:45,553 INFO L226 Difference]: Without dead ends: 8866 [2025-03-16 20:30:45,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:45,558 INFO L435 NwaCegarLoop]: 1623 mSDtfsCounter, 1504 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 1703 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-16 20:30:45,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 1703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8866 states. [2025-03-16 20:30:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8866 to 8864. [2025-03-16 20:30:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8864 states, 8862 states have (on average 1.4822839088241933) internal successors, (13136), 8863 states have internal predecessors, (13136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8864 states to 8864 states and 13136 transitions. [2025-03-16 20:30:45,701 INFO L78 Accepts]: Start accepts. Automaton has 8864 states and 13136 transitions. Word has length 68 [2025-03-16 20:30:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:45,701 INFO L471 AbstractCegarLoop]: Abstraction has 8864 states and 13136 transitions. [2025-03-16 20:30:45,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 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-16 20:30:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 8864 states and 13136 transitions. [2025-03-16 20:30:45,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:45,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:45,703 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] [2025-03-16 20:30:45,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:30:45,704 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:45,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1763107670, now seen corresponding path program 1 times [2025-03-16 20:30:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84570899] [2025-03-16 20:30:45,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:45,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:45,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:45,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:45,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:30:45,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:45,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84570899] [2025-03-16 20:30:45,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84570899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:45,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:45,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:45,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138286217] [2025-03-16 20:30:45,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:45,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:45,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:45,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:45,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:45,837 INFO L87 Difference]: Start difference. First operand 8864 states and 13136 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-16 20:30:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:46,566 INFO L93 Difference]: Finished difference Result 49582 states and 72247 transitions. [2025-03-16 20:30:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:46,566 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 86 [2025-03-16 20:30:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:46,636 INFO L225 Difference]: With dead ends: 49582 [2025-03-16 20:30:46,637 INFO L226 Difference]: Without dead ends: 43020 [2025-03-16 20:30:46,658 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-16 20:30:46,658 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8100 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8100 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:46,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8100 Valid, 3919 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43020 states. [2025-03-16 20:30:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43020 to 15424. [2025-03-16 20:30:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15424 states, 15422 states have (on average 1.4638827648813384) internal successors, (22576), 15423 states have internal predecessors, (22576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15424 states to 15424 states and 22576 transitions. [2025-03-16 20:30:47,129 INFO L78 Accepts]: Start accepts. Automaton has 15424 states and 22576 transitions. Word has length 86 [2025-03-16 20:30:47,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:47,129 INFO L471 AbstractCegarLoop]: Abstraction has 15424 states and 22576 transitions. [2025-03-16 20:30:47,129 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-16 20:30:47,129 INFO L276 IsEmpty]: Start isEmpty. Operand 15424 states and 22576 transitions. [2025-03-16 20:30:47,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:47,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:47,131 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] [2025-03-16 20:30:47,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:30:47,131 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:47,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:47,131 INFO L85 PathProgramCache]: Analyzing trace with hash -919748694, now seen corresponding path program 1 times [2025-03-16 20:30:47,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:47,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235439639] [2025-03-16 20:30:47,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:47,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:47,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:47,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:47,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:47,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:47,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:30:47,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:47,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235439639] [2025-03-16 20:30:47,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235439639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:47,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:47,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:47,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497995591] [2025-03-16 20:30:47,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:47,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:47,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:47,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:47,268 INFO L87 Difference]: Start difference. First operand 15424 states and 22576 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-16 20:30:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:47,889 INFO L93 Difference]: Finished difference Result 56142 states and 81687 transitions. [2025-03-16 20:30:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:47,890 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 86 [2025-03-16 20:30:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:47,956 INFO L225 Difference]: With dead ends: 56142 [2025-03-16 20:30:47,956 INFO L226 Difference]: Without dead ends: 49580 [2025-03-16 20:30:47,968 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-16 20:30:47,969 INFO L435 NwaCegarLoop]: 1635 mSDtfsCounter, 8144 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8144 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:47,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8144 Valid, 3815 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49580 states. [2025-03-16 20:30:48,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49580 to 25280. [2025-03-16 20:30:48,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25280 states, 25278 states have (on average 1.4501147242661603) internal successors, (36656), 25279 states have internal predecessors, (36656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25280 states to 25280 states and 36656 transitions. [2025-03-16 20:30:48,546 INFO L78 Accepts]: Start accepts. Automaton has 25280 states and 36656 transitions. Word has length 86 [2025-03-16 20:30:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:48,546 INFO L471 AbstractCegarLoop]: Abstraction has 25280 states and 36656 transitions. [2025-03-16 20:30:48,546 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-16 20:30:48,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25280 states and 36656 transitions. [2025-03-16 20:30:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:48,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:48,549 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] [2025-03-16 20:30:48,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:30:48,549 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:48,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:48,549 INFO L85 PathProgramCache]: Analyzing trace with hash -162708054, now seen corresponding path program 1 times [2025-03-16 20:30:48,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:48,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223038626] [2025-03-16 20:30:48,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:48,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:48,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:48,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:48,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 20:30:48,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223038626] [2025-03-16 20:30:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223038626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913485006] [2025-03-16 20:30:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:48,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:48,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:48,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:48,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:48,675 INFO L87 Difference]: Start difference. First operand 25280 states and 36656 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:49,796 INFO L93 Difference]: Finished difference Result 62702 states and 91127 transitions. [2025-03-16 20:30:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2025-03-16 20:30:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:49,869 INFO L225 Difference]: With dead ends: 62702 [2025-03-16 20:30:49,870 INFO L226 Difference]: Without dead ends: 56140 [2025-03-16 20:30:49,891 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-16 20:30:49,891 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 8211 mSDsluCounter, 2218 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8211 SdHoareTripleChecker+Valid, 3850 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:49,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8211 Valid, 3850 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56140 states. [2025-03-16 20:30:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56140 to 31840. [2025-03-16 20:30:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31840 states, 31838 states have (on average 1.4478296375400466) internal successors, (46096), 31839 states have internal predecessors, (46096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:50,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31840 states to 31840 states and 46096 transitions. [2025-03-16 20:30:50,783 INFO L78 Accepts]: Start accepts. Automaton has 31840 states and 46096 transitions. Word has length 86 [2025-03-16 20:30:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:50,783 INFO L471 AbstractCegarLoop]: Abstraction has 31840 states and 46096 transitions. [2025-03-16 20:30:50,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31840 states and 46096 transitions. [2025-03-16 20:30:50,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:50,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:50,786 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] [2025-03-16 20:30:50,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 20:30:50,786 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash -712496982, now seen corresponding path program 1 times [2025-03-16 20:30:50,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:50,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758281983] [2025-03-16 20:30:50,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:50,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:50,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:50,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:50,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:50,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 20:30:50,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:50,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758281983] [2025-03-16 20:30:50,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758281983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:50,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:50,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215730039] [2025-03-16 20:30:50,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:50,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:50,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:50,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:50,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:50,907 INFO L87 Difference]: Start difference. First operand 31840 states and 46096 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:51,818 INFO L93 Difference]: Finished difference Result 69262 states and 100567 transitions. [2025-03-16 20:30:51,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:51,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 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 86 [2025-03-16 20:30:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:51,897 INFO L225 Difference]: With dead ends: 69262 [2025-03-16 20:30:51,897 INFO L226 Difference]: Without dead ends: 62700 [2025-03-16 20:30:51,912 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-16 20:30:51,913 INFO L435 NwaCegarLoop]: 1633 mSDtfsCounter, 8130 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8130 SdHoareTripleChecker+Valid, 3856 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:51,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8130 Valid, 3856 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:51,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62700 states. [2025-03-16 20:30:52,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62700 to 38400. [2025-03-16 20:30:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38400 states, 38398 states have (on average 1.446325329444242) internal successors, (55536), 38399 states have internal predecessors, (55536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:52,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38400 states to 38400 states and 55536 transitions. [2025-03-16 20:30:52,932 INFO L78 Accepts]: Start accepts. Automaton has 38400 states and 55536 transitions. Word has length 86 [2025-03-16 20:30:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:52,932 INFO L471 AbstractCegarLoop]: Abstraction has 38400 states and 55536 transitions. [2025-03-16 20:30:52,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38400 states and 55536 transitions. [2025-03-16 20:30:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 20:30:52,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:52,935 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] [2025-03-16 20:30:52,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 20:30:52,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:52,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash -96525654, now seen corresponding path program 1 times [2025-03-16 20:30:52,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:52,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206865308] [2025-03-16 20:30:52,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:52,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:52,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 20:30:52,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 20:30:52,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:52,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 20:30:53,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:53,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206865308] [2025-03-16 20:30:53,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206865308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:53,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:53,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:53,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98999563] [2025-03-16 20:30:53,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:53,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:53,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:53,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:53,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:53,052 INFO L87 Difference]: Start difference. First operand 38400 states and 55536 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-16 20:30:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:54,424 INFO L93 Difference]: Finished difference Result 75822 states and 110007 transitions. [2025-03-16 20:30:54,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:54,424 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 86 [2025-03-16 20:30:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:54,522 INFO L225 Difference]: With dead ends: 75822 [2025-03-16 20:30:54,522 INFO L226 Difference]: Without dead ends: 69260 [2025-03-16 20:30:54,542 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-16 20:30:54,543 INFO L435 NwaCegarLoop]: 1638 mSDtfsCounter, 8038 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8038 SdHoareTripleChecker+Valid, 4001 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:54,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8038 Valid, 4001 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69260 states. [2025-03-16 20:30:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69260 to 44960. [2025-03-16 20:30:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44960 states, 44958 states have (on average 1.4452600204635437) internal successors, (64976), 44959 states have internal predecessors, (64976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44960 states to 44960 states and 64976 transitions. [2025-03-16 20:30:55,744 INFO L78 Accepts]: Start accepts. Automaton has 44960 states and 64976 transitions. Word has length 86 [2025-03-16 20:30:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:55,744 INFO L471 AbstractCegarLoop]: Abstraction has 44960 states and 64976 transitions. [2025-03-16 20:30:55,744 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-16 20:30:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44960 states and 64976 transitions. [2025-03-16 20:30:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:30:55,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:55,747 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] [2025-03-16 20:30:55,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 20:30:55,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -2092174036, now seen corresponding path program 1 times [2025-03-16 20:30:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:55,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252548515] [2025-03-16 20:30:55,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:55,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:30:55,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:30:55,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:55,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252548515] [2025-03-16 20:30:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252548515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308996463] [2025-03-16 20:30:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:55,811 INFO L87 Difference]: Start difference. First operand 44960 states and 64976 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:56,285 INFO L93 Difference]: Finished difference Result 74937 states and 108680 transitions. [2025-03-16 20:30:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:30:56,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-16 20:30:56,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:56,325 INFO L225 Difference]: With dead ends: 74937 [2025-03-16 20:30:56,325 INFO L226 Difference]: Without dead ends: 32279 [2025-03-16 20:30:56,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:56,358 INFO L435 NwaCegarLoop]: 1610 mSDtfsCounter, 58 mSDsluCounter, 1547 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3157 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-16 20:30:56,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3157 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:30:56,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32279 states. [2025-03-16 20:30:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32279 to 32277. [2025-03-16 20:30:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32277 states, 32275 states have (on average 1.4526723470178156) internal successors, (46885), 32276 states have internal predecessors, (46885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32277 states to 32277 states and 46885 transitions. [2025-03-16 20:30:57,068 INFO L78 Accepts]: Start accepts. Automaton has 32277 states and 46885 transitions. Word has length 88 [2025-03-16 20:30:57,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:57,068 INFO L471 AbstractCegarLoop]: Abstraction has 32277 states and 46885 transitions. [2025-03-16 20:30:57,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 32277 states and 46885 transitions. [2025-03-16 20:30:57,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 20:30:57,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:57,069 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] [2025-03-16 20:30:57,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 20:30:57,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:57,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1952924214, now seen corresponding path program 1 times [2025-03-16 20:30:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:57,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160754486] [2025-03-16 20:30:57,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:57,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:57,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 20:30:57,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 20:30:57,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:57,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:30:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:57,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160754486] [2025-03-16 20:30:57,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160754486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:57,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 20:30:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394121483] [2025-03-16 20:30:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:57,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 20:30:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:57,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 20:30:57,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:30:57,177 INFO L87 Difference]: Start difference. First operand 32277 states and 46885 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-16 20:30:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:30:58,528 INFO L93 Difference]: Finished difference Result 59939 states and 87212 transitions. [2025-03-16 20:30:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 20:30:58,528 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 88 [2025-03-16 20:30:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:30:58,602 INFO L225 Difference]: With dead ends: 59939 [2025-03-16 20:30:58,602 INFO L226 Difference]: Without dead ends: 55329 [2025-03-16 20:30:58,624 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-16 20:30:58,625 INFO L435 NwaCegarLoop]: 1630 mSDtfsCounter, 8104 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8104 SdHoareTripleChecker+Valid, 4088 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:30:58,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8104 Valid, 4088 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:30:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55329 states. [2025-03-16 20:30:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55329 to 36885. [2025-03-16 20:30:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 36883 states have (on average 1.4516443890139088) internal successors, (53541), 36884 states have internal predecessors, (53541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:30:59,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 53541 transitions. [2025-03-16 20:30:59,815 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 53541 transitions. Word has length 88 [2025-03-16 20:30:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:30:59,815 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 53541 transitions. [2025-03-16 20:30:59,815 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-16 20:30:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 53541 transitions. [2025-03-16 20:30:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 20:30:59,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:30:59,817 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] [2025-03-16 20:30:59,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 20:30:59,817 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:30:59,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:30:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1726696622, now seen corresponding path program 1 times [2025-03-16 20:30:59,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:30:59,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864565184] [2025-03-16 20:30:59,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:30:59,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:30:59,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 20:30:59,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 20:30:59,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:30:59,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:30:59,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:30:59,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:30:59,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864565184] [2025-03-16 20:30:59,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864565184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:30:59,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:30:59,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:30:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160877502] [2025-03-16 20:30:59,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:30:59,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:30:59,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:30:59,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:30:59,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:30:59,882 INFO L87 Difference]: Start difference. First operand 36885 states and 53541 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-16 20:31:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:00,286 INFO L93 Difference]: Finished difference Result 54169 states and 78503 transitions. [2025-03-16 20:31:00,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:00,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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 89 [2025-03-16 20:31:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:00,310 INFO L225 Difference]: With dead ends: 54169 [2025-03-16 20:31:00,311 INFO L226 Difference]: Without dead ends: 19607 [2025-03-16 20:31:00,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:00,330 INFO L435 NwaCegarLoop]: 1603 mSDtfsCounter, 53 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3142 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-16 20:31:00,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3142 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19607 states. [2025-03-16 20:31:00,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19607 to 19605. [2025-03-16 20:31:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19605 states, 19603 states have (on average 1.4457480997806458) internal successors, (28341), 19604 states have internal predecessors, (28341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:00,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19605 states to 19605 states and 28341 transitions. [2025-03-16 20:31:00,695 INFO L78 Accepts]: Start accepts. Automaton has 19605 states and 28341 transitions. Word has length 89 [2025-03-16 20:31:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:00,695 INFO L471 AbstractCegarLoop]: Abstraction has 19605 states and 28341 transitions. [2025-03-16 20:31:00,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 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-16 20:31:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 19605 states and 28341 transitions. [2025-03-16 20:31:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 20:31:00,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:00,696 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] [2025-03-16 20:31:00,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:31:00,697 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:00,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:00,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1478915573, now seen corresponding path program 1 times [2025-03-16 20:31:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:00,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265078436] [2025-03-16 20:31:00,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:00,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-16 20:31:00,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-16 20:31:00,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:00,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:00,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265078436] [2025-03-16 20:31:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265078436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:00,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:00,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:00,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84503000] [2025-03-16 20:31:00,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:00,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:00,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:00,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:00,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:00,756 INFO L87 Difference]: Start difference. First operand 19605 states and 28341 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-16 20:31:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:00,915 INFO L93 Difference]: Finished difference Result 28249 states and 40703 transitions. [2025-03-16 20:31:00,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:00,916 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-16 20:31:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:00,928 INFO L225 Difference]: With dead ends: 28249 [2025-03-16 20:31:00,929 INFO L226 Difference]: Without dead ends: 10967 [2025-03-16 20:31:00,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:00,941 INFO L435 NwaCegarLoop]: 1596 mSDtfsCounter, 50 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 3127 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-16 20:31:00,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 3127 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10967 states. [2025-03-16 20:31:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10967 to 10965. [2025-03-16 20:31:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10965 states, 10963 states have (on average 1.4467755176502781) internal successors, (15861), 10964 states have internal predecessors, (15861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10965 states to 10965 states and 15861 transitions. [2025-03-16 20:31:01,233 INFO L78 Accepts]: Start accepts. Automaton has 10965 states and 15861 transitions. Word has length 91 [2025-03-16 20:31:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:01,233 INFO L471 AbstractCegarLoop]: Abstraction has 10965 states and 15861 transitions. [2025-03-16 20:31:01,233 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-16 20:31:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 10965 states and 15861 transitions. [2025-03-16 20:31:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:31:01,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:01,235 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] [2025-03-16 20:31:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 20:31:01,235 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 551699396, now seen corresponding path program 1 times [2025-03-16 20:31:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743617574] [2025-03-16 20:31:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:01,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:31:01,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:31:01,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:01,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:01,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743617574] [2025-03-16 20:31:01,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743617574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:01,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:01,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829307768] [2025-03-16 20:31:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:01,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:01,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:01,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,300 INFO L87 Difference]: Start difference. First operand 10965 states and 15861 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-16 20:31:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:01,387 INFO L93 Difference]: Finished difference Result 15289 states and 21983 transitions. [2025-03-16 20:31:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:01,388 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-16 20:31:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:01,396 INFO L225 Difference]: With dead ends: 15289 [2025-03-16 20:31:01,396 INFO L226 Difference]: Without dead ends: 6647 [2025-03-16 20:31:01,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,402 INFO L435 NwaCegarLoop]: 1589 mSDtfsCounter, 47 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3112 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-16 20:31:01,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 3112 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6647 states. [2025-03-16 20:31:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6647 to 6645. [2025-03-16 20:31:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6645 states, 6643 states have (on average 1.4573234984193888) internal successors, (9681), 6644 states have internal predecessors, (9681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6645 states to 6645 states and 9681 transitions. [2025-03-16 20:31:01,513 INFO L78 Accepts]: Start accepts. Automaton has 6645 states and 9681 transitions. Word has length 93 [2025-03-16 20:31:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 6645 states and 9681 transitions. [2025-03-16 20:31:01,513 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-16 20:31:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 6645 states and 9681 transitions. [2025-03-16 20:31:01,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 20:31:01,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:01,514 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] [2025-03-16 20:31:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 20:31:01,514 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2030858365, now seen corresponding path program 1 times [2025-03-16 20:31:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451245890] [2025-03-16 20:31:01,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:01,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 20:31:01,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 20:31:01,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:01,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:01,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451245890] [2025-03-16 20:31:01,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451245890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:01,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104540327] [2025-03-16 20:31:01,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:01,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:01,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:01,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,572 INFO L87 Difference]: Start difference. First operand 6645 states and 9681 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-16 20:31:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:01,624 INFO L93 Difference]: Finished difference Result 8809 states and 12713 transitions. [2025-03-16 20:31:01,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:01,625 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-16 20:31:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:01,630 INFO L225 Difference]: With dead ends: 8809 [2025-03-16 20:31:01,630 INFO L226 Difference]: Without dead ends: 4487 [2025-03-16 20:31:01,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,633 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 44 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 3097 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-16 20:31:01,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 3097 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2025-03-16 20:31:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2025-03-16 20:31:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4483 states have (on average 1.4769127816194512) internal successors, (6621), 4484 states have internal predecessors, (6621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:01,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6621 transitions. [2025-03-16 20:31:01,695 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6621 transitions. Word has length 95 [2025-03-16 20:31:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 4485 states and 6621 transitions. [2025-03-16 20:31:01,695 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-16 20:31:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6621 transitions. [2025-03-16 20:31:01,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 20:31:01,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:01,696 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] [2025-03-16 20:31:01,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 20:31:01,696 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:01,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:01,696 INFO L85 PathProgramCache]: Analyzing trace with hash 308650038, now seen corresponding path program 1 times [2025-03-16 20:31:01,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691301289] [2025-03-16 20:31:01,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 20:31:01,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 20:31:01,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:01,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:01,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:01,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:01,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691301289] [2025-03-16 20:31:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691301289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:31:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:31:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:31:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059845077] [2025-03-16 20:31:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:31:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:31:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:31:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,757 INFO L87 Difference]: Start difference. First operand 4485 states and 6621 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-16 20:31:01,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:01,791 INFO L93 Difference]: Finished difference Result 5569 states and 8123 transitions. [2025-03-16 20:31:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:31:01,791 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-16 20:31:01,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:01,796 INFO L225 Difference]: With dead ends: 5569 [2025-03-16 20:31:01,796 INFO L226 Difference]: Without dead ends: 3407 [2025-03-16 20:31:01,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:31:01,798 INFO L435 NwaCegarLoop]: 1575 mSDtfsCounter, 41 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3082 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-16 20:31:01,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3082 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:31:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3407 states. [2025-03-16 20:31:01,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3407 to 3405. [2025-03-16 20:31:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3403 states have (on average 1.5004407875404056) internal successors, (5106), 3404 states have internal predecessors, (5106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 5106 transitions. [2025-03-16 20:31:01,839 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 5106 transitions. Word has length 97 [2025-03-16 20:31:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:01,839 INFO L471 AbstractCegarLoop]: Abstraction has 3405 states and 5106 transitions. [2025-03-16 20:31:01,839 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-16 20:31:01,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 5106 transitions. [2025-03-16 20:31:01,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 20:31:01,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:01,840 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] [2025-03-16 20:31:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 20:31:01,840 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:01,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash 892035823, now seen corresponding path program 1 times [2025-03-16 20:31:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:01,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170602692] [2025-03-16 20:31:01,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:01,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:01,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:01,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:01,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:01,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:02,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170602692] [2025-03-16 20:31:02,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170602692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:02,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438920790] [2025-03-16 20:31:02,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:02,414 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:31:02,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:31:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 20:31:02,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 20:31:02,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:02,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:02,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 20:31:02,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:02,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438920790] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:03,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 21 [2025-03-16 20:31:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225462183] [2025-03-16 20:31:03,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:31:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:03,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:31:03,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:31:03,241 INFO L87 Difference]: Start difference. First operand 3405 states and 5106 transitions. Second operand has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:06,987 INFO L93 Difference]: Finished difference Result 13399 states and 18602 transitions. [2025-03-16 20:31:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-16 20:31:06,988 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 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-16 20:31:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:07,000 INFO L225 Difference]: With dead ends: 13399 [2025-03-16 20:31:07,000 INFO L226 Difference]: Without dead ends: 12219 [2025-03-16 20:31:07,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1278, Invalid=6912, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 20:31:07,005 INFO L435 NwaCegarLoop]: 1551 mSDtfsCounter, 18494 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18494 SdHoareTripleChecker+Valid, 9833 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:07,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18494 Valid, 9833 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 20:31:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12219 states. [2025-03-16 20:31:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12219 to 11549. [2025-03-16 20:31:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11549 states, 11547 states have (on average 1.3783666753269248) internal successors, (15916), 11548 states have internal predecessors, (15916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11549 states to 11549 states and 15916 transitions. [2025-03-16 20:31:07,238 INFO L78 Accepts]: Start accepts. Automaton has 11549 states and 15916 transitions. Word has length 99 [2025-03-16 20:31:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:07,238 INFO L471 AbstractCegarLoop]: Abstraction has 11549 states and 15916 transitions. [2025-03-16 20:31:07,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 13.666666666666666) internal successors, (287), 21 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 11549 states and 15916 transitions. [2025-03-16 20:31:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:07,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:07,239 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:31:07,247 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-16 20:31:07,440 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,SelfDestructingSolverStorable25 [2025-03-16 20:31:07,440 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:07,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:07,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1400023222, now seen corresponding path program 1 times [2025-03-16 20:31:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228669320] [2025-03-16 20:31:07,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:07,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:07,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:07,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:07,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228669320] [2025-03-16 20:31:07,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228669320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:07,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458550375] [2025-03-16 20:31:07,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:07,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:07,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:07,745 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-16 20:31:07,745 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-16 20:31:07,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:07,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:07,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:07,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:07,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:31:07,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:08,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:08,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458550375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:08,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-16 20:31:08,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272820663] [2025-03-16 20:31:08,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:08,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-16 20:31:08,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:09,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-16 20:31:09,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-16 20:31:09,000 INFO L87 Difference]: Start difference. First operand 11549 states and 15916 transitions. Second operand has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:10,234 INFO L93 Difference]: Finished difference Result 24623 states and 33327 transitions. [2025-03-16 20:31:10,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:31:10,234 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:31:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:10,249 INFO L225 Difference]: With dead ends: 24623 [2025-03-16 20:31:10,249 INFO L226 Difference]: Without dead ends: 15585 [2025-03-16 20:31:10,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=513, Invalid=1839, Unknown=0, NotChecked=0, Total=2352 [2025-03-16 20:31:10,253 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 18869 mSDsluCounter, 5129 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18869 SdHoareTripleChecker+Valid, 6643 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:10,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18869 Valid, 6643 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:31:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15585 states. [2025-03-16 20:31:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15585 to 14215. [2025-03-16 20:31:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14215 states, 14213 states have (on average 1.3483430662069935) internal successors, (19164), 14214 states have internal predecessors, (19164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14215 states to 14215 states and 19164 transitions. [2025-03-16 20:31:10,591 INFO L78 Accepts]: Start accepts. Automaton has 14215 states and 19164 transitions. Word has length 100 [2025-03-16 20:31:10,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:10,591 INFO L471 AbstractCegarLoop]: Abstraction has 14215 states and 19164 transitions. [2025-03-16 20:31:10,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.923076923076923) internal successors, (284), 25 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 14215 states and 19164 transitions. [2025-03-16 20:31:10,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-16 20:31:10,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:10,592 INFO L218 NwaCegarLoop]: trace histogram [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-16 20:31:10,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 20:31:10,792 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-16 20:31:10,793 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1450460490, now seen corresponding path program 1 times [2025-03-16 20:31:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052093424] [2025-03-16 20:31:10,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:10,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:10,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:10,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:10,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:11,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052093424] [2025-03-16 20:31:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052093424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800008519] [2025-03-16 20:31:11,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:11,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:11,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:11,113 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-16 20:31:11,115 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-16 20:31:11,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-16 20:31:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-16 20:31:11,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:11,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:11,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 20:31:11,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:11,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:12,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:12,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800008519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:12,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:12,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-16 20:31:12,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94748556] [2025-03-16 20:31:12,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:12,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 20:31:12,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:12,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 20:31:12,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2025-03-16 20:31:12,023 INFO L87 Difference]: Start difference. First operand 14215 states and 19164 transitions. Second operand has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:13,822 INFO L93 Difference]: Finished difference Result 42273 states and 55862 transitions. [2025-03-16 20:31:13,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-16 20:31:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-03-16 20:31:13,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:13,860 INFO L225 Difference]: With dead ends: 42273 [2025-03-16 20:31:13,860 INFO L226 Difference]: Without dead ends: 30391 [2025-03-16 20:31:13,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=615, Invalid=2247, Unknown=0, NotChecked=0, Total=2862 [2025-03-16 20:31:13,871 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 18987 mSDsluCounter, 8647 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18987 SdHoareTripleChecker+Valid, 10223 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:13,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18987 Valid, 10223 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:31:13,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30391 states. [2025-03-16 20:31:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30391 to 30251. [2025-03-16 20:31:14,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30251 states, 30249 states have (on average 1.315745975073556) internal successors, (39800), 30250 states have internal predecessors, (39800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30251 states to 30251 states and 39800 transitions. [2025-03-16 20:31:14,835 INFO L78 Accepts]: Start accepts. Automaton has 30251 states and 39800 transitions. Word has length 100 [2025-03-16 20:31:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:14,835 INFO L471 AbstractCegarLoop]: Abstraction has 30251 states and 39800 transitions. [2025-03-16 20:31:14,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.88) internal successors, (247), 24 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 30251 states and 39800 transitions. [2025-03-16 20:31:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 20:31:14,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:14,837 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:14,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 20:31:15,037 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-16 20:31:15,038 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:15,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1441796728, now seen corresponding path program 1 times [2025-03-16 20:31:15,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461745752] [2025-03-16 20:31:15,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:15,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:15,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:15,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461745752] [2025-03-16 20:31:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461745752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504956635] [2025-03-16 20:31:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:15,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:15,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:15,294 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-16 20:31:15,295 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-16 20:31:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 20:31:15,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 20:31:15,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:15,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:15,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:31:15,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:15,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:16,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504956635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:16,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:16,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 31 [2025-03-16 20:31:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418365847] [2025-03-16 20:31:16,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 20:31:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:16,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 20:31:16,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-03-16 20:31:16,760 INFO L87 Difference]: Start difference. First operand 30251 states and 39800 transitions. Second operand has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:20,938 INFO L93 Difference]: Finished difference Result 114709 states and 149561 transitions. [2025-03-16 20:31:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-16 20:31:20,938 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 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-16 20:31:20,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:21,033 INFO L225 Difference]: With dead ends: 114709 [2025-03-16 20:31:21,034 INFO L226 Difference]: Without dead ends: 86847 [2025-03-16 20:31:21,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=739, Invalid=3043, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:31:21,051 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 17501 mSDsluCounter, 8348 mSDsCounter, 0 mSdLazyCounter, 1277 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17501 SdHoareTripleChecker+Valid, 9874 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:21,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17501 Valid, 9874 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1277 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:31:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86847 states. [2025-03-16 20:31:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86847 to 86527. [2025-03-16 20:31:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86527 states, 86525 states have (on average 1.2855359722623518) internal successors, (111231), 86526 states have internal predecessors, (111231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86527 states to 86527 states and 111231 transitions. [2025-03-16 20:31:24,695 INFO L78 Accepts]: Start accepts. Automaton has 86527 states and 111231 transitions. Word has length 102 [2025-03-16 20:31:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 86527 states and 111231 transitions. [2025-03-16 20:31:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.612903225806452) internal successors, (267), 31 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 86527 states and 111231 transitions. [2025-03-16 20:31:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:24,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:24,698 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:24,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 20:31:24,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 20:31:24,899 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:24,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:24,899 INFO L85 PathProgramCache]: Analyzing trace with hash 2050371838, now seen corresponding path program 1 times [2025-03-16 20:31:24,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:24,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594736430] [2025-03-16 20:31:24,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:24,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:24,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:24,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:24,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:25,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:25,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594736430] [2025-03-16 20:31:25,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594736430] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:25,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342919769] [2025-03-16 20:31:25,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:25,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:25,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:25,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:31:25,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:31:25,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:25,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:25,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:25,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:25,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:31:25,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:31:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:26,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:31:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342919769] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:31:27,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:31:27,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-03-16 20:31:27,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844888078] [2025-03-16 20:31:27,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:31:27,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 20:31:27,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:31:27,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 20:31:27,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:31:27,163 INFO L87 Difference]: Start difference. First operand 86527 states and 111231 transitions. Second operand has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:31:33,120 INFO L93 Difference]: Finished difference Result 200228 states and 256976 transitions. [2025-03-16 20:31:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 20:31:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-16 20:31:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:31:33,335 INFO L225 Difference]: With dead ends: 200228 [2025-03-16 20:31:33,335 INFO L226 Difference]: Without dead ends: 179885 [2025-03-16 20:31:33,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2025-03-16 20:31:33,367 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 10394 mSDsluCounter, 11088 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10394 SdHoareTripleChecker+Valid, 12637 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:31:33,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10394 Valid, 12637 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:31:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179885 states. [2025-03-16 20:31:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179885 to 86821. [2025-03-16 20:31:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86821 states, 86819 states have (on average 1.2851449567490987) internal successors, (111575), 86820 states have internal predecessors, (111575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86821 states to 86821 states and 111575 transitions. [2025-03-16 20:31:37,065 INFO L78 Accepts]: Start accepts. Automaton has 86821 states and 111575 transitions. Word has length 104 [2025-03-16 20:31:37,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:31:37,065 INFO L471 AbstractCegarLoop]: Abstraction has 86821 states and 111575 transitions. [2025-03-16 20:31:37,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.566666666666666) internal successors, (227), 30 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:31:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand 86821 states and 111575 transitions. [2025-03-16 20:31:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 20:31:37,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:31:37,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:31:37,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:31:37,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:37,267 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:31:37,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:31:37,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1005936834, now seen corresponding path program 1 times [2025-03-16 20:31:37,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:31:37,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535415757] [2025-03-16 20:31:37,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:37,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:31:37,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:37,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:37,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:37,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:31:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:31:37,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535415757] [2025-03-16 20:31:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535415757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:31:37,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713634866] [2025-03-16 20:31:37,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:31:37,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:31:37,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:31:37,891 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:31:37,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:31:37,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 20:31:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 20:31:38,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:31:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:31:38,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-03-16 20:31:38,028 INFO L279 TraceCheckSpWp]: Computing forward predicates...