./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.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 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 16:06:43,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 16:06:43,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 16:06:43,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 16:06:43,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 16:06:43,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 16:06:43,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 16:06:43,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 16:06:43,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 16:06:43,444 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 16:06:43,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 16:06:43,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 16:06:43,444 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 16:06:43,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 16:06:43,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 16:06:43,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 16:06:43,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:06:43,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 16:06:43,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 16:06:43,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 16:06:43,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 16:06:43,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 16:06:43,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 16:06:43,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 16:06:43,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 16:06:43,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 16:06:43,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 16:06:43,448 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 -> 4fdd5c1041cb450f4848a5d2243efab154355b9039f1e674dfe24010b27b76eb [2025-03-03 16:06:43,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 16:06:43,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 16:06:43,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 16:06:43,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 16:06:43,711 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 16:06:43,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:06:44,839 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae71dc78e/54f6d8c1655d42338223cfae2fbaa7d0/FLAG38e6dda89 [2025-03-03 16:06:45,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 16:06:45,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:06:45,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae71dc78e/54f6d8c1655d42338223cfae2fbaa7d0/FLAG38e6dda89 [2025-03-03 16:06:45,411 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae71dc78e/54f6d8c1655d42338223cfae2fbaa7d0 [2025-03-03 16:06:45,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 16:06:45,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 16:06:45,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 16:06:45,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 16:06:45,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 16:06:45,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:06:45" (1/1) ... [2025-03-03 16:06:45,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ba6db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:45, skipping insertion in model container [2025-03-03 16:06:45,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 04:06:45" (1/1) ... [2025-03-03 16:06:45,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 16:06:45,783 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.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-03-03 16:06:45,811 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.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-03-03 16:06:46,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:06:46,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 16:06:46,292 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.4.ufo.UNBOUNDED.pals+Problem12_label07.c[8712,8725] [2025-03-03 16:06:46,294 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.4.ufo.UNBOUNDED.pals+Problem12_label07.c[9554,9567] [2025-03-03 16:06:46,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 16:06:46,576 INFO L204 MainTranslator]: Completed translation [2025-03-03 16:06:46,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46 WrapperNode [2025-03-03 16:06:46,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 16:06:46,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 16:06:46,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 16:06:46,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 16:06:46,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,821 INFO L138 Inliner]: procedures = 36, calls = 21, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 5033 [2025-03-03 16:06:46,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 16:06:46,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 16:06:46,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 16:06:46,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 16:06:46,828 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 16:06:46,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:46,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 16:06:47,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 16:06:47,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 16:06:47,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 16:06:47,180 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (1/1) ... [2025-03-03 16:06:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 16:06:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:47,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 16:06:47,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 16:06:47,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 16:06:47,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 16:06:47,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 16:06:47,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 16:06:47,299 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 16:06:47,301 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 16:06:50,617 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5025: havoc calculate_output3_#t~ret35#1; [2025-03-03 16:06:50,618 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc calculate_output_#t~ret33#1; [2025-03-03 16:06:50,618 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3535: havoc calculate_output2_#t~ret34#1; [2025-03-03 16:06:50,799 INFO L? ?]: Removed 739 outVars from TransFormulas that were not future-live. [2025-03-03 16:06:50,800 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 16:06:50,828 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 16:06:50,832 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 16:06:50,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:06:50 BoogieIcfgContainer [2025-03-03 16:06:50,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 16:06:50,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 16:06:50,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 16:06:50,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 16:06:50,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 04:06:45" (1/3) ... [2025-03-03 16:06:50,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8ed693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:06:50, skipping insertion in model container [2025-03-03 16:06:50,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 04:06:46" (2/3) ... [2025-03-03 16:06:50,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8ed693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 04:06:50, skipping insertion in model container [2025-03-03 16:06:50,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 04:06:50" (3/3) ... [2025-03-03 16:06:50,842 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c [2025-03-03 16:06:50,859 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 16:06:50,862 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals+Problem12_label07.c that has 1 procedures, 886 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-03 16:06:50,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 16:06:50,942 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;@452056e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 16:06:50,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 16:06:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-03 16:06:50,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:50,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:06:50,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:50,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2094908143, now seen corresponding path program 1 times [2025-03-03 16:06:50,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:50,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532392335] [2025-03-03 16:06:50,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:50,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:51,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-03 16:06:51,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-03 16:06:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:51,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:51,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532392335] [2025-03-03 16:06:51,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532392335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:51,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:51,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 16:06:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926379393] [2025-03-03 16:06:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:51,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:51,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:51,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:51,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:51,173 INFO L87 Difference]: Start difference. First operand has 886 states, 883 states have (on average 1.9037372593431483) internal successors, (1681), 885 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:54,025 INFO L93 Difference]: Finished difference Result 2497 states and 4808 transitions. [2025-03-03 16:06:54,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-03-03 16:06:54,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:54,038 INFO L225 Difference]: With dead ends: 2497 [2025-03-03 16:06:54,038 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 16:06:54,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:54,043 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 965 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:54,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 216 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 16:06:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 16:06:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 16:06:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.8636942675159236) internal successors, (2926), 1571 states have internal predecessors, (2926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2926 transitions. [2025-03-03 16:06:54,129 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2926 transitions. Word has length 7 [2025-03-03 16:06:54,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:54,129 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2926 transitions. [2025-03-03 16:06:54,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2926 transitions. [2025-03-03 16:06:54,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 16:06:54,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:54,130 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] [2025-03-03 16:06:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 16:06:54,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1841298800, now seen corresponding path program 1 times [2025-03-03 16:06:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461453115] [2025-03-03 16:06:54,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:54,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:54,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 16:06:54,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 16:06:54,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:54,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:54,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:54,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:54,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461453115] [2025-03-03 16:06:54,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461453115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:54,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:54,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:06:54,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524342735] [2025-03-03 16:06:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:54,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:06:54,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:54,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:06:54,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:54,317 INFO L87 Difference]: Start difference. First operand 1572 states and 2926 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:54,369 INFO L93 Difference]: Finished difference Result 1614 states and 2990 transitions. [2025-03-03 16:06:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:06:54,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-03 16:06:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:54,374 INFO L225 Difference]: With dead ends: 1614 [2025-03-03 16:06:54,374 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 16:06:54,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:54,375 INFO L435 NwaCegarLoop]: 1549 mSDtfsCounter, 0 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6168 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:54,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6168 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 16:06:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 16:06:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1570 states have (on average 1.849044585987261) internal successors, (2903), 1571 states have internal predecessors, (2903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2903 transitions. [2025-03-03 16:06:54,408 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2903 transitions. Word has length 22 [2025-03-03 16:06:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:54,409 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2903 transitions. [2025-03-03 16:06:54,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2903 transitions. [2025-03-03 16:06:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 16:06:54,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:54,411 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] [2025-03-03 16:06:54,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 16:06:54,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:54,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 483422138, now seen corresponding path program 1 times [2025-03-03 16:06:54,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:54,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950702351] [2025-03-03 16:06:54,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:54,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:54,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-03 16:06:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 16:06:54,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:54,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:54,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950702351] [2025-03-03 16:06:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950702351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947670393] [2025-03-03 16:06:54,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:54,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:54,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:54,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:54,589 INFO L87 Difference]: Start difference. First operand 1572 states and 2903 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:54,701 INFO L93 Difference]: Finished difference Result 1876 states and 3383 transitions. [2025-03-03 16:06:54,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 16:06:54,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-03-03 16:06:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:54,708 INFO L225 Difference]: With dead ends: 1876 [2025-03-03 16:06:54,708 INFO L226 Difference]: Without dead ends: 1838 [2025-03-03 16:06:54,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 16:06:54,709 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 6285 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6285 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:54,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6285 Valid, 2135 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:06:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-03-03 16:06:54,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1608. [2025-03-03 16:06:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1606 states have (on average 1.8430884184308842) internal successors, (2960), 1607 states have internal predecessors, (2960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2960 transitions. [2025-03-03 16:06:54,736 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2960 transitions. Word has length 44 [2025-03-03 16:06:54,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:54,736 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2960 transitions. [2025-03-03 16:06:54,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2960 transitions. [2025-03-03 16:06:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:06:54,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:54,737 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] [2025-03-03 16:06:54,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 16:06:54,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:54,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:54,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1832559893, now seen corresponding path program 1 times [2025-03-03 16:06:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11493372] [2025-03-03 16:06:54,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:54,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:06:54,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:06:54,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:54,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:54,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:54,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11493372] [2025-03-03 16:06:54,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11493372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:54,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:54,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:54,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041886171] [2025-03-03 16:06:54,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:54,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:54,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:54,810 INFO L87 Difference]: Start difference. First operand 1608 states and 2960 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:54,841 INFO L93 Difference]: Finished difference Result 1745 states and 3175 transitions. [2025-03-03 16:06:54,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:54,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-03 16:06:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:54,847 INFO L225 Difference]: With dead ends: 1745 [2025-03-03 16:06:54,847 INFO L226 Difference]: Without dead ends: 1671 [2025-03-03 16:06:54,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:54,850 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 1476 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:54,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1577 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2025-03-03 16:06:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1667. [2025-03-03 16:06:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8318318318318318) internal successors, (3050), 1666 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3050 transitions. [2025-03-03 16:06:54,880 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3050 transitions. Word has length 46 [2025-03-03 16:06:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:54,881 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3050 transitions. [2025-03-03 16:06:54,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3050 transitions. [2025-03-03 16:06:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 16:06:54,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:54,885 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] [2025-03-03 16:06:54,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 16:06:54,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:54,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:54,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1864883128, now seen corresponding path program 1 times [2025-03-03 16:06:54,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:54,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035736541] [2025-03-03 16:06:54,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:54,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:54,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-03 16:06:54,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-03 16:06:54,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:54,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035736541] [2025-03-03 16:06:55,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035736541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983509654] [2025-03-03 16:06:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:55,098 INFO L87 Difference]: Start difference. First operand 1667 states and 3050 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,187 INFO L93 Difference]: Finished difference Result 1802 states and 3258 transitions. [2025-03-03 16:06:55,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:55,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-03-03 16:06:55,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,194 INFO L225 Difference]: With dead ends: 1802 [2025-03-03 16:06:55,194 INFO L226 Difference]: Without dead ends: 1669 [2025-03-03 16:06:55,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 16:06:55,195 INFO L435 NwaCegarLoop]: 1522 mSDtfsCounter, 4455 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4455 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4455 Valid, 1690 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2025-03-03 16:06:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1667. [2025-03-03 16:06:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1665 states have (on average 1.8306306306306306) internal successors, (3048), 1666 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 3048 transitions. [2025-03-03 16:06:55,225 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 3048 transitions. Word has length 46 [2025-03-03 16:06:55,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,227 INFO L471 AbstractCegarLoop]: Abstraction has 1667 states and 3048 transitions. [2025-03-03 16:06:55,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 3048 transitions. [2025-03-03 16:06:55,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 16:06:55,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,228 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-03 16:06:55,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 16:06:55,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2007339854, now seen corresponding path program 1 times [2025-03-03 16:06:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013311518] [2025-03-03 16:06:55,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 16:06:55,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 16:06:55,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013311518] [2025-03-03 16:06:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013311518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 16:06:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973845742] [2025-03-03 16:06:55,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 16:06:55,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 16:06:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:55,373 INFO L87 Difference]: Start difference. First operand 1667 states and 3048 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:06:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,404 INFO L93 Difference]: Finished difference Result 1675 states and 3057 transitions. [2025-03-03 16:06:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 16:06:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:06:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,409 INFO L225 Difference]: With dead ends: 1675 [2025-03-03 16:06:55,410 INFO L226 Difference]: Without dead ends: 1673 [2025-03-03 16:06:55,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 16:06:55,411 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6091 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2025-03-03 16:06:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1673. [2025-03-03 16:06:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1673 states, 1671 states have (on average 1.827049670855775) internal successors, (3053), 1672 states have internal predecessors, (3053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 3053 transitions. [2025-03-03 16:06:55,439 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 3053 transitions. Word has length 47 [2025-03-03 16:06:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,439 INFO L471 AbstractCegarLoop]: Abstraction has 1673 states and 3053 transitions. [2025-03-03 16:06:55,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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-03 16:06:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 3053 transitions. [2025-03-03 16:06:55,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:55,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,441 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] [2025-03-03 16:06:55,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 16:06:55,441 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash 56563094, now seen corresponding path program 1 times [2025-03-03 16:06:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326266017] [2025-03-03 16:06:55,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:55,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:55,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326266017] [2025-03-03 16:06:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326266017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841591571] [2025-03-03 16:06:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:55,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,496 INFO L87 Difference]: Start difference. First operand 1673 states and 3053 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,519 INFO L93 Difference]: Finished difference Result 1935 states and 3445 transitions. [2025-03-03 16:06:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-03 16:06:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,525 INFO L225 Difference]: With dead ends: 1935 [2025-03-03 16:06:55,526 INFO L226 Difference]: Without dead ends: 1796 [2025-03-03 16:06:55,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,527 INFO L435 NwaCegarLoop]: 1565 mSDtfsCounter, 1487 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 1630 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2025-03-03 16:06:55,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1794. [2025-03-03 16:06:55,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.8024553571428572) internal successors, (3230), 1793 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 3230 transitions. [2025-03-03 16:06:55,561 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 3230 transitions. Word has length 48 [2025-03-03 16:06:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,562 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 3230 transitions. [2025-03-03 16:06:55,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 3230 transitions. [2025-03-03 16:06:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:55,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,563 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] [2025-03-03 16:06:55,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 16:06:55,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 471738966, now seen corresponding path program 1 times [2025-03-03 16:06:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722184504] [2025-03-03 16:06:55,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:55,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:55,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722184504] [2025-03-03 16:06:55,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722184504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:55,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097154891] [2025-03-03 16:06:55,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:55,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:55,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,620 INFO L87 Difference]: Start difference. First operand 1794 states and 3230 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,647 INFO L93 Difference]: Finished difference Result 2282 states and 3948 transitions. [2025-03-03 16:06:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:55,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-03 16:06:55,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,654 INFO L225 Difference]: With dead ends: 2282 [2025-03-03 16:06:55,654 INFO L226 Difference]: Without dead ends: 2022 [2025-03-03 16:06:55,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,655 INFO L435 NwaCegarLoop]: 1563 mSDtfsCounter, 1485 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 1632 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-03-03 16:06:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2020. [2025-03-03 16:06:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2020 states, 2018 states have (on average 1.7601585728444005) internal successors, (3552), 2019 states have internal predecessors, (3552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 3552 transitions. [2025-03-03 16:06:55,690 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 3552 transitions. Word has length 48 [2025-03-03 16:06:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,690 INFO L471 AbstractCegarLoop]: Abstraction has 2020 states and 3552 transitions. [2025-03-03 16:06:55,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 3552 transitions. [2025-03-03 16:06:55,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 16:06:55,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,691 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] [2025-03-03 16:06:55,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 16:06:55,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -14979306, now seen corresponding path program 1 times [2025-03-03 16:06:55,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20348103] [2025-03-03 16:06:55,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 16:06:55,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 16:06:55,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20348103] [2025-03-03 16:06:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20348103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403731965] [2025-03-03 16:06:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:55,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,768 INFO L87 Difference]: Start difference. First operand 2020 states and 3552 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,796 INFO L93 Difference]: Finished difference Result 2928 states and 4858 transitions. [2025-03-03 16:06:55,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:55,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-03 16:06:55,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,804 INFO L225 Difference]: With dead ends: 2928 [2025-03-03 16:06:55,804 INFO L226 Difference]: Without dead ends: 2442 [2025-03-03 16:06:55,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,808 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1483 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 1634 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-03-03 16:06:55,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2440. [2025-03-03 16:06:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2438 states have (on average 1.6948318293683347) internal successors, (4132), 2439 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-03 16:06:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 4132 transitions. [2025-03-03 16:06:55,851 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 4132 transitions. Word has length 48 [2025-03-03 16:06:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,852 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 4132 transitions. [2025-03-03 16:06:55,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 4132 transitions. [2025-03-03 16:06:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 16:06:55,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,853 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] [2025-03-03 16:06:55,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 16:06:55,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash -2144209802, now seen corresponding path program 1 times [2025-03-03 16:06:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107488967] [2025-03-03 16:06:55,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 16:06:55,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 16:06:55,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:55,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:55,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107488967] [2025-03-03 16:06:55,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107488967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:55,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:55,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670999592] [2025-03-03 16:06:55,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:55,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:55,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:55,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:55,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,896 INFO L87 Difference]: Start difference. First operand 2440 states and 4132 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:55,928 INFO L93 Difference]: Finished difference Result 3407 states and 5530 transitions. [2025-03-03 16:06:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:55,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 16:06:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:55,935 INFO L225 Difference]: With dead ends: 3407 [2025-03-03 16:06:55,936 INFO L226 Difference]: Without dead ends: 2876 [2025-03-03 16:06:55,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:55,937 INFO L435 NwaCegarLoop]: 1570 mSDtfsCounter, 1486 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1486 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:55,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1486 Valid, 1631 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2025-03-03 16:06:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2874. [2025-03-03 16:06:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2872 states have (on average 1.6483286908077994) internal successors, (4734), 2873 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4734 transitions. [2025-03-03 16:06:55,982 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4734 transitions. Word has length 50 [2025-03-03 16:06:55,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:55,983 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4734 transitions. [2025-03-03 16:06:55,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4734 transitions. [2025-03-03 16:06:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:55,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:55,984 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] [2025-03-03 16:06:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 16:06:55,984 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:55,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1690582205, now seen corresponding path program 1 times [2025-03-03 16:06:55,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:55,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874078432] [2025-03-03 16:06:55,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:55,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:55,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:55,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:55,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 16:06:56,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:56,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874078432] [2025-03-03 16:06:56,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874078432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:56,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:56,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:56,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280905170] [2025-03-03 16:06:56,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:56,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:56,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:56,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:56,078 INFO L87 Difference]: Start difference. First operand 2874 states and 4734 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-03 16:06:56,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:56,205 INFO L93 Difference]: Finished difference Result 8524 states and 12691 transitions. [2025-03-03 16:06:56,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:56,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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 65 [2025-03-03 16:06:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:56,226 INFO L225 Difference]: With dead ends: 8524 [2025-03-03 16:06:56,227 INFO L226 Difference]: Without dead ends: 7186 [2025-03-03 16:06:56,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:56,231 INFO L435 NwaCegarLoop]: 1582 mSDtfsCounter, 4667 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:56,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 3350 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:56,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2025-03-03 16:06:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4210. [2025-03-03 16:06:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4210 states, 4208 states have (on average 1.5679657794676807) internal successors, (6598), 4209 states have internal predecessors, (6598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4210 states to 4210 states and 6598 transitions. [2025-03-03 16:06:56,330 INFO L78 Accepts]: Start accepts. Automaton has 4210 states and 6598 transitions. Word has length 65 [2025-03-03 16:06:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:56,330 INFO L471 AbstractCegarLoop]: Abstraction has 4210 states and 6598 transitions. [2025-03-03 16:06:56,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 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-03 16:06:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4210 states and 6598 transitions. [2025-03-03 16:06:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:56,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:56,331 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] [2025-03-03 16:06:56,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 16:06:56,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:56,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2105758077, now seen corresponding path program 1 times [2025-03-03 16:06:56,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:56,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989453159] [2025-03-03 16:06:56,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:56,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:56,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:56,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:56,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:56,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 16:06:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989453159] [2025-03-03 16:06:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989453159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:56,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148476199] [2025-03-03 16:06:56,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:56,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:56,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:56,448 INFO L87 Difference]: Start difference. First operand 4210 states and 6598 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:56,606 INFO L93 Difference]: Finished difference Result 9860 states and 14555 transitions. [2025-03-03 16:06:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:56,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:06:56,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:56,623 INFO L225 Difference]: With dead ends: 9860 [2025-03-03 16:06:56,623 INFO L226 Difference]: Without dead ends: 8522 [2025-03-03 16:06:56,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:56,628 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 4688 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 3318 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:56,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 3318 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8522 states. [2025-03-03 16:06:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8522 to 6218. [2025-03-03 16:06:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6218 states, 6216 states have (on average 1.508043758043758) internal successors, (9374), 6217 states have internal predecessors, (9374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6218 states to 6218 states and 9374 transitions. [2025-03-03 16:06:56,755 INFO L78 Accepts]: Start accepts. Automaton has 6218 states and 9374 transitions. Word has length 65 [2025-03-03 16:06:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:56,755 INFO L471 AbstractCegarLoop]: Abstraction has 6218 states and 9374 transitions. [2025-03-03 16:06:56,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6218 states and 9374 transitions. [2025-03-03 16:06:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 16:06:56,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:56,757 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] [2025-03-03 16:06:56,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 16:06:56,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1619039805, now seen corresponding path program 1 times [2025-03-03 16:06:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664200336] [2025-03-03 16:06:56,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:56,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 16:06:56,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 16:06:56,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:56,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 16:06:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664200336] [2025-03-03 16:06:56,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664200336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:56,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:56,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:56,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207101616] [2025-03-03 16:06:56,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:56,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:56,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:56,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:56,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:56,897 INFO L87 Difference]: Start difference. First operand 6218 states and 9374 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:57,051 INFO L93 Difference]: Finished difference Result 11196 states and 16419 transitions. [2025-03-03 16:06:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-03 16:06:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:57,067 INFO L225 Difference]: With dead ends: 11196 [2025-03-03 16:06:57,068 INFO L226 Difference]: Without dead ends: 9858 [2025-03-03 16:06:57,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:57,073 INFO L435 NwaCegarLoop]: 1581 mSDtfsCounter, 4673 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 3337 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:57,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 3337 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9858 states. [2025-03-03 16:06:57,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9858 to 7554. [2025-03-03 16:06:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7554 states, 7552 states have (on average 1.488082627118644) internal successors, (11238), 7553 states have internal predecessors, (11238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7554 states to 7554 states and 11238 transitions. [2025-03-03 16:06:57,221 INFO L78 Accepts]: Start accepts. Automaton has 7554 states and 11238 transitions. Word has length 65 [2025-03-03 16:06:57,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:57,221 INFO L471 AbstractCegarLoop]: Abstraction has 7554 states and 11238 transitions. [2025-03-03 16:06:57,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7554 states and 11238 transitions. [2025-03-03 16:06:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:06:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:57,222 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] [2025-03-03 16:06:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 16:06:57,223 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:57,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1990429701, now seen corresponding path program 1 times [2025-03-03 16:06:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845996705] [2025-03-03 16:06:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:57,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:06:57,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:06:57,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:57,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:57,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:57,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:57,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845996705] [2025-03-03 16:06:57,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845996705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982968523] [2025-03-03 16:06:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:57,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:57,292 INFO L87 Difference]: Start difference. First operand 7554 states and 11238 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:57,363 INFO L93 Difference]: Finished difference Result 11896 states and 17379 transitions. [2025-03-03 16:06:57,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-03-03 16:06:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:57,373 INFO L225 Difference]: With dead ends: 11896 [2025-03-03 16:06:57,373 INFO L226 Difference]: Without dead ends: 5878 [2025-03-03 16:06:57,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:57,379 INFO L435 NwaCegarLoop]: 1560 mSDtfsCounter, 42 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:57,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3073 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2025-03-03 16:06:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5876. [2025-03-03 16:06:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5876 states, 5874 states have (on average 1.5171944160708206) internal successors, (8912), 5875 states have internal predecessors, (8912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5876 states to 5876 states and 8912 transitions. [2025-03-03 16:06:57,475 INFO L78 Accepts]: Start accepts. Automaton has 5876 states and 8912 transitions. Word has length 67 [2025-03-03 16:06:57,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:57,475 INFO L471 AbstractCegarLoop]: Abstraction has 5876 states and 8912 transitions. [2025-03-03 16:06:57,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 5876 states and 8912 transitions. [2025-03-03 16:06:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 16:06:57,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:57,476 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] [2025-03-03 16:06:57,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 16:06:57,476 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:57,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:57,477 INFO L85 PathProgramCache]: Analyzing trace with hash 485092829, now seen corresponding path program 1 times [2025-03-03 16:06:57,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:57,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858982090] [2025-03-03 16:06:57,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:57,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:57,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 16:06:57,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 16:06:57,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:57,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 16:06:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858982090] [2025-03-03 16:06:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858982090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 16:06:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127532801] [2025-03-03 16:06:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:57,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 16:06:57,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:57,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 16:06:57,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 16:06:57,565 INFO L87 Difference]: Start difference. First operand 5876 states and 8912 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-03 16:06:57,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:57,743 INFO L93 Difference]: Finished difference Result 9726 states and 14357 transitions. [2025-03-03 16:06:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 16:06:57,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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 67 [2025-03-03 16:06:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:57,756 INFO L225 Difference]: With dead ends: 9726 [2025-03-03 16:06:57,756 INFO L226 Difference]: Without dead ends: 8764 [2025-03-03 16:06:57,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 16:06:57,759 INFO L435 NwaCegarLoop]: 1577 mSDtfsCounter, 4665 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 3404 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:57,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 3404 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8764 states. [2025-03-03 16:06:57,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8764 to 6836. [2025-03-03 16:06:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6836 states, 6834 states have (on average 1.5007316359379572) internal successors, (10256), 6835 states have internal predecessors, (10256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6836 states to 6836 states and 10256 transitions. [2025-03-03 16:06:57,877 INFO L78 Accepts]: Start accepts. Automaton has 6836 states and 10256 transitions. Word has length 67 [2025-03-03 16:06:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:57,878 INFO L471 AbstractCegarLoop]: Abstraction has 6836 states and 10256 transitions. [2025-03-03 16:06:57,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 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-03 16:06:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6836 states and 10256 transitions. [2025-03-03 16:06:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 16:06:57,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:57,879 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] [2025-03-03 16:06:57,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 16:06:57,879 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:57,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash 317371601, now seen corresponding path program 1 times [2025-03-03 16:06:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467873167] [2025-03-03 16:06:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:57,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:57,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 16:06:57,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 16:06:57,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:57,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:57,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467873167] [2025-03-03 16:06:57,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467873167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:57,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:57,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:57,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455587572] [2025-03-03 16:06:57,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:57,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:57,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:57,947 INFO L87 Difference]: Start difference. First operand 6836 states and 10256 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-03 16:06:57,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:57,991 INFO L93 Difference]: Finished difference Result 9480 states and 13954 transitions. [2025-03-03 16:06:57,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:57,991 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-03 16:06:57,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:57,998 INFO L225 Difference]: With dead ends: 9480 [2025-03-03 16:06:57,998 INFO L226 Difference]: Without dead ends: 4198 [2025-03-03 16:06:58,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:58,003 INFO L435 NwaCegarLoop]: 1553 mSDtfsCounter, 37 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 3058 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:58,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 3058 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4198 states. [2025-03-03 16:06:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4198 to 4196. [2025-03-03 16:06:58,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4194 states have (on average 1.553648068669528) internal successors, (6516), 4195 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 6516 transitions. [2025-03-03 16:06:58,062 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 6516 transitions. Word has length 68 [2025-03-03 16:06:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:58,062 INFO L471 AbstractCegarLoop]: Abstraction has 4196 states and 6516 transitions. [2025-03-03 16:06:58,062 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-03 16:06:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 6516 transitions. [2025-03-03 16:06:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 16:06:58,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:58,063 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] [2025-03-03 16:06:58,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 16:06:58,063 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:58,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:58,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1409098024, now seen corresponding path program 1 times [2025-03-03 16:06:58,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:58,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495758866] [2025-03-03 16:06:58,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:58,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:58,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 16:06:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 16:06:58,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:58,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495758866] [2025-03-03 16:06:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495758866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269962622] [2025-03-03 16:06:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:58,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:58,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:58,145 INFO L87 Difference]: Start difference. First operand 4196 states and 6516 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:58,175 INFO L93 Difference]: Finished difference Result 5520 states and 8344 transitions. [2025-03-03 16:06:58,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:58,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-03-03 16:06:58,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:58,180 INFO L225 Difference]: With dead ends: 5520 [2025-03-03 16:06:58,181 INFO L226 Difference]: Without dead ends: 2878 [2025-03-03 16:06:58,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:58,184 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 34 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:58,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3043 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2025-03-03 16:06:58,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2876. [2025-03-03 16:06:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2874 states have (on average 1.6242171189979122) internal successors, (4668), 2875 states have internal predecessors, (4668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4668 transitions. [2025-03-03 16:06:58,225 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4668 transitions. Word has length 70 [2025-03-03 16:06:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:58,225 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4668 transitions. [2025-03-03 16:06:58,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4668 transitions. [2025-03-03 16:06:58,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 16:06:58,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:58,226 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] [2025-03-03 16:06:58,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 16:06:58,226 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:58,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash -505296385, now seen corresponding path program 1 times [2025-03-03 16:06:58,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:58,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412994585] [2025-03-03 16:06:58,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:58,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:58,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 16:06:58,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 16:06:58,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:58,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:58,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:58,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412994585] [2025-03-03 16:06:58,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412994585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 16:06:58,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 16:06:58,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 16:06:58,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024886514] [2025-03-03 16:06:58,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 16:06:58,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 16:06:58,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:06:58,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 16:06:58,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:58,290 INFO L87 Difference]: Start difference. First operand 2876 states and 4668 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:06:58,313 INFO L93 Difference]: Finished difference Result 3540 states and 5572 transitions. [2025-03-03 16:06:58,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 16:06:58,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-03 16:06:58,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:06:58,317 INFO L225 Difference]: With dead ends: 3540 [2025-03-03 16:06:58,317 INFO L226 Difference]: Without dead ends: 2218 [2025-03-03 16:06:58,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 16:06:58,319 INFO L435 NwaCegarLoop]: 1539 mSDtfsCounter, 31 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 16:06:58,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3028 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 16:06:58,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-03-03 16:06:58,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2216. [2025-03-03 16:06:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2216 states, 2214 states have (on average 1.6960252935862692) internal successors, (3755), 2215 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2216 states to 2216 states and 3755 transitions. [2025-03-03 16:06:58,346 INFO L78 Accepts]: Start accepts. Automaton has 2216 states and 3755 transitions. Word has length 72 [2025-03-03 16:06:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:06:58,346 INFO L471 AbstractCegarLoop]: Abstraction has 2216 states and 3755 transitions. [2025-03-03 16:06:58,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:06:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2216 states and 3755 transitions. [2025-03-03 16:06:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 16:06:58,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:06:58,347 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] [2025-03-03 16:06:58,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 16:06:58,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:06:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:06:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 163046982, now seen corresponding path program 1 times [2025-03-03 16:06:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:06:58,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249300425] [2025-03-03 16:06:58,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:58,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:06:58,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:06:58,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:06:58,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:58,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:06:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249300425] [2025-03-03 16:06:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249300425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:06:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222012637] [2025-03-03 16:06:59,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:06:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:06:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:06:59,611 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:06:59,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 16:06:59,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 16:06:59,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 16:06:59,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:06:59,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:06:59,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 16:06:59,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:06:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:06:59,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:00,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222012637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:00,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:00,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 22 [2025-03-03 16:07:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276697574] [2025-03-03 16:07:00,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:00,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 16:07:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 16:07:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-03 16:07:00,218 INFO L87 Difference]: Start difference. First operand 2216 states and 3755 transitions. Second operand has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:02,922 INFO L93 Difference]: Finished difference Result 8272 states and 11803 transitions. [2025-03-03 16:07:02,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-03 16:07:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 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 74 [2025-03-03 16:07:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:02,933 INFO L225 Difference]: With dead ends: 8272 [2025-03-03 16:07:02,933 INFO L226 Difference]: Without dead ends: 7536 [2025-03-03 16:07:02,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1313, Invalid=7243, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 16:07:02,939 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 11766 mSDsluCounter, 9491 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11766 SdHoareTripleChecker+Valid, 11008 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:02,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11766 Valid, 11008 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 16:07:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7536 states. [2025-03-03 16:07:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7536 to 7038. [2025-03-03 16:07:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7036 states have (on average 1.4246731097214327) internal successors, (10024), 7037 states have internal predecessors, (10024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 10024 transitions. [2025-03-03 16:07:03,109 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 10024 transitions. Word has length 74 [2025-03-03 16:07:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:03,109 INFO L471 AbstractCegarLoop]: Abstraction has 7038 states and 10024 transitions. [2025-03-03 16:07:03,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 10024 transitions. [2025-03-03 16:07:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:07:03,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:03,111 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:07:03,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 16:07:03,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:03,317 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:03,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:03,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1032286997, now seen corresponding path program 1 times [2025-03-03 16:07:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440042156] [2025-03-03 16:07:03,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:03,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:03,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:03,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:03,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:04,183 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:04,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440042156] [2025-03-03 16:07:04,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440042156] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:04,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787690394] [2025-03-03 16:07:04,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:04,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:04,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:04,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 16:07:04,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:04,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:04,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:04,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:04,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 16:07:04,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:04,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787690394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:05,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 13] total 31 [2025-03-03 16:07:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104623802] [2025-03-03 16:07:05,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:05,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 16:07:05,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:05,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 16:07:05,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2025-03-03 16:07:05,456 INFO L87 Difference]: Start difference. First operand 7038 states and 10024 transitions. Second operand has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:07,391 INFO L93 Difference]: Finished difference Result 27900 states and 37211 transitions. [2025-03-03 16:07:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 16:07:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 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 75 [2025-03-03 16:07:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:07,423 INFO L225 Difference]: With dead ends: 27900 [2025-03-03 16:07:07,424 INFO L226 Difference]: Without dead ends: 22490 [2025-03-03 16:07:07,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=697, Invalid=3335, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 16:07:07,435 INFO L435 NwaCegarLoop]: 1492 mSDtfsCounter, 14092 mSDsluCounter, 8036 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14092 SdHoareTripleChecker+Valid, 9528 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:07,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14092 Valid, 9528 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 16:07:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22490 states. [2025-03-03 16:07:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22490 to 22326. [2025-03-03 16:07:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22326 states, 22324 states have (on average 1.3313922236158395) internal successors, (29722), 22325 states have internal predecessors, (29722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22326 states to 22326 states and 29722 transitions. [2025-03-03 16:07:08,006 INFO L78 Accepts]: Start accepts. Automaton has 22326 states and 29722 transitions. Word has length 75 [2025-03-03 16:07:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:08,006 INFO L471 AbstractCegarLoop]: Abstraction has 22326 states and 29722 transitions. [2025-03-03 16:07:08,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 6.548387096774194) internal successors, (203), 31 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22326 states and 29722 transitions. [2025-03-03 16:07:08,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:07:08,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:08,008 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:07:08,014 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-03 16:07:08,212 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,SelfDestructingSolverStorable19 [2025-03-03 16:07:08,213 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1424546165, now seen corresponding path program 1 times [2025-03-03 16:07:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617739844] [2025-03-03 16:07:08,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:08,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:08,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:08,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:08,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:08,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:08,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617739844] [2025-03-03 16:07:08,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617739844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:08,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637338621] [2025-03-03 16:07:08,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:08,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:08,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:08,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:08,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 16:07:08,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:08,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:08,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:08,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:08,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:07:08,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:08,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:09,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637338621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:09,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 16:07:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974062312] [2025-03-03 16:07:09,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:09,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:07:09,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:09,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:07:09,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:07:09,351 INFO L87 Difference]: Start difference. First operand 22326 states and 29722 transitions. Second operand has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:09,987 INFO L93 Difference]: Finished difference Result 42686 states and 56185 transitions. [2025-03-03 16:07:09,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:07:09,988 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 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 75 [2025-03-03 16:07:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:10,016 INFO L225 Difference]: With dead ends: 42686 [2025-03-03 16:07:10,017 INFO L226 Difference]: Without dead ends: 23218 [2025-03-03 16:07:10,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:07:10,035 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 18125 mSDsluCounter, 4615 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18125 SdHoareTripleChecker+Valid, 6116 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:10,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18125 Valid, 6116 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:07:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23218 states. [2025-03-03 16:07:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23218 to 21858. [2025-03-03 16:07:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21858 states, 21856 states have (on average 1.3183107613469984) internal successors, (28813), 21857 states have internal predecessors, (28813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21858 states to 21858 states and 28813 transitions. [2025-03-03 16:07:10,564 INFO L78 Accepts]: Start accepts. Automaton has 21858 states and 28813 transitions. Word has length 75 [2025-03-03 16:07:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:10,565 INFO L471 AbstractCegarLoop]: Abstraction has 21858 states and 28813 transitions. [2025-03-03 16:07:10,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.782608695652174) internal successors, (179), 22 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 21858 states and 28813 transitions. [2025-03-03 16:07:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 16:07:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:10,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:07:10,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 16:07:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:10,771 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1434856139, now seen corresponding path program 1 times [2025-03-03 16:07:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:10,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414375192] [2025-03-03 16:07:10,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:10,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:10,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:10,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:10,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:11,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414375192] [2025-03-03 16:07:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414375192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951353045] [2025-03-03 16:07:11,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:11,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:11,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:11,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:11,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 16:07:11,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 16:07:11,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 16:07:11,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:11,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:11,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 16:07:11,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:11,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951353045] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:12,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 16:07:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167077758] [2025-03-03 16:07:12,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:12,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 16:07:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:12,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 16:07:12,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-03 16:07:12,094 INFO L87 Difference]: Start difference. First operand 21858 states and 28813 transitions. Second operand has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:13,104 INFO L93 Difference]: Finished difference Result 63206 states and 82018 transitions. [2025-03-03 16:07:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:07:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 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 75 [2025-03-03 16:07:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:13,151 INFO L225 Difference]: With dead ends: 63206 [2025-03-03 16:07:13,151 INFO L226 Difference]: Without dead ends: 43718 [2025-03-03 16:07:13,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2025-03-03 16:07:13,167 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 12079 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12079 SdHoareTripleChecker+Valid, 6273 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:13,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12079 Valid, 6273 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:07:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43718 states. [2025-03-03 16:07:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43718 to 43170. [2025-03-03 16:07:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43170 states, 43168 states have (on average 1.2832190511489994) internal successors, (55394), 43169 states have internal predecessors, (55394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43170 states to 43170 states and 55394 transitions. [2025-03-03 16:07:14,542 INFO L78 Accepts]: Start accepts. Automaton has 43170 states and 55394 transitions. Word has length 75 [2025-03-03 16:07:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:14,543 INFO L471 AbstractCegarLoop]: Abstraction has 43170 states and 55394 transitions. [2025-03-03 16:07:14,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.666666666666667) internal successors, (161), 20 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 43170 states and 55394 transitions. [2025-03-03 16:07:14,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 16:07:14,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:14,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 16:07:14,622 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-03 16:07:14,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:14,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:14,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:14,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1161185343, now seen corresponding path program 1 times [2025-03-03 16:07:14,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886149043] [2025-03-03 16:07:14,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:14,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:07:14,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:07:14,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:14,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886149043] [2025-03-03 16:07:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886149043] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430245955] [2025-03-03 16:07:14,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:14,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:14,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:14,951 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-03 16:07:14,952 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-03 16:07:15,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 16:07:15,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 16:07:15,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:15,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:15,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 16:07:15,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:15,332 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:15,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430245955] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:15,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-03 16:07:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531341115] [2025-03-03 16:07:15,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:15,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 16:07:15,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:15,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 16:07:15,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-03 16:07:15,743 INFO L87 Difference]: Start difference. First operand 43170 states and 55394 transitions. Second operand has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:16,857 INFO L93 Difference]: Finished difference Result 84532 states and 107966 transitions. [2025-03-03 16:07:16,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 16:07:16,857 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 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 76 [2025-03-03 16:07:16,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:16,897 INFO L225 Difference]: With dead ends: 84532 [2025-03-03 16:07:16,897 INFO L226 Difference]: Without dead ends: 44854 [2025-03-03 16:07:16,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 16:07:16,910 INFO L435 NwaCegarLoop]: 1517 mSDtfsCounter, 20806 mSDsluCounter, 6287 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20806 SdHoareTripleChecker+Valid, 7804 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:16,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20806 Valid, 7804 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 16:07:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44854 states. [2025-03-03 16:07:17,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44854 to 42370. [2025-03-03 16:07:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42370 states, 42368 states have (on average 1.2733666918429003) internal successors, (53950), 42369 states have internal predecessors, (53950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42370 states to 42370 states and 53950 transitions. [2025-03-03 16:07:17,855 INFO L78 Accepts]: Start accepts. Automaton has 42370 states and 53950 transitions. Word has length 76 [2025-03-03 16:07:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 42370 states and 53950 transitions. [2025-03-03 16:07:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 22 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42370 states and 53950 transitions. [2025-03-03 16:07:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:07:17,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:17,857 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:07:17,864 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-03 16:07:18,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 16:07:18,058 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1571986160, now seen corresponding path program 1 times [2025-03-03 16:07:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208669439] [2025-03-03 16:07:18,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:18,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:07:18,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:07:18,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:18,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:18,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208669439] [2025-03-03 16:07:18,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208669439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:18,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890679021] [2025-03-03 16:07:18,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:18,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:18,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:18,651 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-03 16:07:18,652 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-03 16:07:18,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:07:18,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:07:18,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:18,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 16:07:18,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:22,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:23,593 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:23,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890679021] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:23,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:23,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 45 [2025-03-03 16:07:23,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968510683] [2025-03-03 16:07:23,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:23,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 16:07:23,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:23,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 16:07:23,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 16:07:23,595 INFO L87 Difference]: Start difference. First operand 42370 states and 53950 transitions. Second operand has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:35,789 INFO L93 Difference]: Finished difference Result 109534 states and 139593 transitions. [2025-03-03 16:07:35,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-03-03 16:07:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:07:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:35,875 INFO L225 Difference]: With dead ends: 109534 [2025-03-03 16:07:35,875 INFO L226 Difference]: Without dead ends: 88744 [2025-03-03 16:07:35,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4983 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=3330, Invalid=12672, Unknown=0, NotChecked=0, Total=16002 [2025-03-03 16:07:35,900 INFO L435 NwaCegarLoop]: 1559 mSDtfsCounter, 19117 mSDsluCounter, 22452 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19117 SdHoareTripleChecker+Valid, 24011 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:35,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19117 Valid, 24011 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 16:07:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88744 states. [2025-03-03 16:07:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88744 to 57894. [2025-03-03 16:07:37,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57894 states, 57892 states have (on average 1.2731120016582602) internal successors, (73703), 57893 states have internal predecessors, (73703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57894 states to 57894 states and 73703 transitions. [2025-03-03 16:07:37,835 INFO L78 Accepts]: Start accepts. Automaton has 57894 states and 73703 transitions. Word has length 77 [2025-03-03 16:07:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:37,836 INFO L471 AbstractCegarLoop]: Abstraction has 57894 states and 73703 transitions. [2025-03-03 16:07:37,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 4.4222222222222225) internal successors, (199), 45 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:37,836 INFO L276 IsEmpty]: Start isEmpty. Operand 57894 states and 73703 transitions. [2025-03-03 16:07:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 16:07:37,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:37,837 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 16:07:37,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 16:07:38,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:38,038 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:38,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1286826896, now seen corresponding path program 1 times [2025-03-03 16:07:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:38,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161253699] [2025-03-03 16:07:38,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:38,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:07:38,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:07:38,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:38,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161253699] [2025-03-03 16:07:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161253699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225819734] [2025-03-03 16:07:38,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:38,593 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:38,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 16:07:38,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 16:07:38,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 16:07:38,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:38,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 16:07:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:39,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:40,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225819734] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:40,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:40,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 36 [2025-03-03 16:07:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670630262] [2025-03-03 16:07:40,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:40,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 16:07:40,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:40,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 16:07:40,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1118, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 16:07:40,753 INFO L87 Difference]: Start difference. First operand 57894 states and 73703 transitions. Second operand has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:43,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 16:07:43,729 INFO L93 Difference]: Finished difference Result 79264 states and 99785 transitions. [2025-03-03 16:07:43,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 16:07:43,730 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 16:07:43,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 16:07:43,784 INFO L225 Difference]: With dead ends: 79264 [2025-03-03 16:07:43,784 INFO L226 Difference]: Without dead ends: 57294 [2025-03-03 16:07:43,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=449, Invalid=2001, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 16:07:43,796 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 9574 mSDsluCounter, 16797 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9574 SdHoareTripleChecker+Valid, 18300 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 16:07:43,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9574 Valid, 18300 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 16:07:43,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57294 states. [2025-03-03 16:07:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57294 to 50628. [2025-03-03 16:07:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50628 states, 50626 states have (on average 1.2715600679492751) internal successors, (64374), 50627 states have internal predecessors, (64374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50628 states to 50628 states and 64374 transitions. [2025-03-03 16:07:45,317 INFO L78 Accepts]: Start accepts. Automaton has 50628 states and 64374 transitions. Word has length 77 [2025-03-03 16:07:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 16:07:45,317 INFO L471 AbstractCegarLoop]: Abstraction has 50628 states and 64374 transitions. [2025-03-03 16:07:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.527777777777778) internal successors, (199), 36 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 16:07:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 50628 states and 64374 transitions. [2025-03-03 16:07:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 16:07:45,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 16:07:45,318 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] [2025-03-03 16:07:45,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 16:07:45,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:45,520 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 16:07:45,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 16:07:45,520 INFO L85 PathProgramCache]: Analyzing trace with hash -221937505, now seen corresponding path program 1 times [2025-03-03 16:07:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 16:07:45,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904928967] [2025-03-03 16:07:45,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 16:07:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:07:45,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:07:45,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:45,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:46,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 16:07:46,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904928967] [2025-03-03 16:07:46,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904928967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 16:07:46,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062811481] [2025-03-03 16:07:46,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 16:07:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 16:07:46,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 16:07:46,149 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 16:07:46,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 16:07:46,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 16:07:46,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 16:07:46,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 16:07:46,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 16:07:46,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 16:07:46,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 16:07:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:49,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 16:07:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 16:07:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062811481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 16:07:53,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 16:07:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 29, 25] total 61 [2025-03-03 16:07:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24317432] [2025-03-03 16:07:53,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 16:07:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 16:07:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 16:07:53,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 16:07:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=3189, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 16:07:53,506 INFO L87 Difference]: Start difference. First operand 50628 states and 64374 transitions. Second operand has 61 states, 61 states have (on average 3.4754098360655736) internal successors, (212), 61 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)