./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i -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 e41e90a8ded7ff3062d090d36a7ca1e3310919bbe5f722b4fd1b9d4da48b6059 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:12:00,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:12:00,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:12:00,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:12:00,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:12:00,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:12:00,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:12:00,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:12:00,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:12:00,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:12:00,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:12:00,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:12:00,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:12:00,224 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:00,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:12:00,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:12:00,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:12:00,225 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 -> e41e90a8ded7ff3062d090d36a7ca1e3310919bbe5f722b4fd1b9d4da48b6059 [2025-03-03 20:12:00,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:12:00,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:12:00,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:12:00,473 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:12:00,473 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:12:00,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-03-03 20:12:01,677 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05243a0/fd8801c3b2db431c910d19fbea6f3b14/FLAG3a05817c7 [2025-03-03 20:12:01,957 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:12:01,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-03-03 20:12:01,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05243a0/fd8801c3b2db431c910d19fbea6f3b14/FLAG3a05817c7 [2025-03-03 20:12:01,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d05243a0/fd8801c3b2db431c910d19fbea6f3b14 [2025-03-03 20:12:01,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:12:01,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:12:01,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:01,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:12:01,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:12:01,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:01" (1/1) ... [2025-03-03 20:12:01,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:01, skipping insertion in model container [2025-03-03 20:12:01,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:01" (1/1) ... [2025-03-03 20:12:02,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:12:02,144 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i[916,929] [2025-03-03 20:12:02,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:02,293 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:12:02,301 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-86.i[916,929] [2025-03-03 20:12:02,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:02,390 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:12:02,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02 WrapperNode [2025-03-03 20:12:02,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:02,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:02,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:12:02,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:12:02,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,486 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 777 [2025-03-03 20:12:02,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:02,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:12:02,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:12:02,488 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:12:02,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,553 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 20:12:02,554 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:12:02,605 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:12:02,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:12:02,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:12:02,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (1/1) ... [2025-03-03 20:12:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:02,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:02,634 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 20:12:02,639 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 20:12:02,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:12:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:12:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:12:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:12:02,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:12:02,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:12:02,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:12:02,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:12:03,773 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2025-03-03 20:12:03,773 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:12:03,810 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:12:03,813 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:12:03,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:03 BoogieIcfgContainer [2025-03-03 20:12:03,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:12:03,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:12:03,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:12:03,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:12:03,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:12:01" (1/3) ... [2025-03-03 20:12:03,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4bdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:03, skipping insertion in model container [2025-03-03 20:12:03,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:02" (2/3) ... [2025-03-03 20:12:03,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce4bdcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:03, skipping insertion in model container [2025-03-03 20:12:03,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:03" (3/3) ... [2025-03-03 20:12:03,823 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-86.i [2025-03-03 20:12:03,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:12:03,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-86.i that has 2 procedures, 322 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:12:03,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:12:03,912 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;@689f477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:12:03,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:12:03,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 239 states have (on average 1.6443514644351465) internal successors, (393), 240 states have internal predecessors, (393), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:12:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 20:12:03,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:03,950 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:03,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:03,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:03,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1376461097, now seen corresponding path program 1 times [2025-03-03 20:12:03,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:03,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606465416] [2025-03-03 20:12:03,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:03,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:04,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 20:12:04,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 20:12:04,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:04,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-03 20:12:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606465416] [2025-03-03 20:12:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606465416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896191393] [2025-03-03 20:12:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:04,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:04,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:04,479 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 20:12:04,481 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 20:12:04,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 20:12:04,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 20:12:04,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:04,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:04,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:12:04,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:12:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-03 20:12:04,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:12:04,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896191393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:04,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:12:04,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:12:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812407801] [2025-03-03 20:12:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:04,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:12:04,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:04,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:12:04,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:04,920 INFO L87 Difference]: Start difference. First operand has 322 states, 239 states have (on average 1.6443514644351465) internal successors, (393), 240 states have internal predecessors, (393), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-03 20:12:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:04,990 INFO L93 Difference]: Finished difference Result 633 states and 1173 transitions. [2025-03-03 20:12:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:12:04,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 538 [2025-03-03 20:12:04,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:05,003 INFO L225 Difference]: With dead ends: 633 [2025-03-03 20:12:05,003 INFO L226 Difference]: Without dead ends: 314 [2025-03-03 20:12:05,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 539 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:12:05,012 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:05,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 521 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-03 20:12:05,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-03 20:12:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 232 states have (on average 1.6206896551724137) internal successors, (376), 232 states have internal predecessors, (376), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:12:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 536 transitions. [2025-03-03 20:12:05,091 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 536 transitions. Word has length 538 [2025-03-03 20:12:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:05,093 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 536 transitions. [2025-03-03 20:12:05,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-03 20:12:05,094 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 536 transitions. [2025-03-03 20:12:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 20:12:05,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:05,103 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:05,112 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 20:12:05,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:12:05,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:05,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:05,314 INFO L85 PathProgramCache]: Analyzing trace with hash 688240448, now seen corresponding path program 1 times [2025-03-03 20:12:05,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442382525] [2025-03-03 20:12:05,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:05,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 20:12:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 20:12:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:05,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:05,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:05,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442382525] [2025-03-03 20:12:05,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442382525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:05,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:05,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286815315] [2025-03-03 20:12:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:05,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:05,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:05,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:05,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:05,970 INFO L87 Difference]: Start difference. First operand 314 states and 536 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:06,063 INFO L93 Difference]: Finished difference Result 820 states and 1397 transitions. [2025-03-03 20:12:06,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-03-03 20:12:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:06,071 INFO L225 Difference]: With dead ends: 820 [2025-03-03 20:12:06,071 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 20:12:06,072 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 20:12:06,072 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 526 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:06,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1162 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 20:12:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 313. [2025-03-03 20:12:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 231 states have (on average 1.6147186147186148) internal successors, (373), 231 states have internal predecessors, (373), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:12:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 533 transitions. [2025-03-03 20:12:06,125 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 533 transitions. Word has length 538 [2025-03-03 20:12:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:06,126 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 533 transitions. [2025-03-03 20:12:06,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 533 transitions. [2025-03-03 20:12:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 20:12:06,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:06,133 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:06,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:12:06,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:06,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:06,134 INFO L85 PathProgramCache]: Analyzing trace with hash 18538593, now seen corresponding path program 1 times [2025-03-03 20:12:06,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:06,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021641412] [2025-03-03 20:12:06,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:06,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:06,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 20:12:06,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 20:12:06,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:06,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:06,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021641412] [2025-03-03 20:12:06,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021641412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:06,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:06,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:06,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904591264] [2025-03-03 20:12:06,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:06,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:06,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:06,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:06,615 INFO L87 Difference]: Start difference. First operand 313 states and 533 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:06,912 INFO L93 Difference]: Finished difference Result 826 states and 1414 transitions. [2025-03-03 20:12:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:06,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-03-03 20:12:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:06,919 INFO L225 Difference]: With dead ends: 826 [2025-03-03 20:12:06,919 INFO L226 Difference]: Without dead ends: 516 [2025-03-03 20:12:06,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:06,921 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 327 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1299 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:12:06,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-03 20:12:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 513. [2025-03-03 20:12:06,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 397 states have (on average 1.6448362720403022) internal successors, (653), 398 states have internal predecessors, (653), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-03 20:12:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 879 transitions. [2025-03-03 20:12:06,966 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 879 transitions. Word has length 538 [2025-03-03 20:12:06,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:06,968 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 879 transitions. [2025-03-03 20:12:06,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 879 transitions. [2025-03-03 20:12:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-03 20:12:06,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:06,976 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:12:06,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 298888482, now seen corresponding path program 1 times [2025-03-03 20:12:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640835497] [2025-03-03 20:12:06,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:07,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-03 20:12:07,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-03 20:12:07,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:07,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:07,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:07,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640835497] [2025-03-03 20:12:07,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640835497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:07,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:07,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:07,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152185353] [2025-03-03 20:12:07,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:07,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:07,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:07,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:07,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:07,265 INFO L87 Difference]: Start difference. First operand 513 states and 879 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:07,392 INFO L93 Difference]: Finished difference Result 1470 states and 2515 transitions. [2025-03-03 20:12:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:07,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 538 [2025-03-03 20:12:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:07,402 INFO L225 Difference]: With dead ends: 1470 [2025-03-03 20:12:07,403 INFO L226 Difference]: Without dead ends: 960 [2025-03-03 20:12:07,404 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 20:12:07,405 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 432 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:07,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1426 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:07,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-03-03 20:12:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 587. [2025-03-03 20:12:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 471 states have (on average 1.6518046709129512) internal successors, (778), 472 states have internal predecessors, (778), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-03 20:12:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 1004 transitions. [2025-03-03 20:12:07,474 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 1004 transitions. Word has length 538 [2025-03-03 20:12:07,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:07,476 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 1004 transitions. [2025-03-03 20:12:07,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:07,476 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1004 transitions. [2025-03-03 20:12:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 20:12:07,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:07,487 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:07,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:12:07,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -413089432, now seen corresponding path program 1 times [2025-03-03 20:12:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431863987] [2025-03-03 20:12:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:07,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 20:12:07,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 20:12:07,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:07,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431863987] [2025-03-03 20:12:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431863987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697201598] [2025-03-03 20:12:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:07,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:07,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:07,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:07,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:07,712 INFO L87 Difference]: Start difference. First operand 587 states and 1004 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:07,790 INFO L93 Difference]: Finished difference Result 1557 states and 2661 transitions. [2025-03-03 20:12:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:07,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 539 [2025-03-03 20:12:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:07,797 INFO L225 Difference]: With dead ends: 1557 [2025-03-03 20:12:07,797 INFO L226 Difference]: Without dead ends: 973 [2025-03-03 20:12:07,799 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 20:12:07,799 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 320 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:07,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1159 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:12:07,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2025-03-03 20:12:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 970. [2025-03-03 20:12:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 765 states have (on average 1.6366013071895424) internal successors, (1252), 768 states have internal predecessors, (1252), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 197 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-03 20:12:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1652 transitions. [2025-03-03 20:12:07,874 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1652 transitions. Word has length 539 [2025-03-03 20:12:07,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:07,875 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1652 transitions. [2025-03-03 20:12:07,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:07,875 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1652 transitions. [2025-03-03 20:12:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 20:12:07,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:07,882 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:07,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:12:07,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:07,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 217369193, now seen corresponding path program 1 times [2025-03-03 20:12:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:07,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514917548] [2025-03-03 20:12:07,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:07,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 20:12:07,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 20:12:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:07,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514917548] [2025-03-03 20:12:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514917548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:08,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803561007] [2025-03-03 20:12:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:08,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:08,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:08,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:08,129 INFO L87 Difference]: Start difference. First operand 970 states and 1652 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:08,278 INFO L93 Difference]: Finished difference Result 2687 states and 4588 transitions. [2025-03-03 20:12:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:08,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 539 [2025-03-03 20:12:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:08,293 INFO L225 Difference]: With dead ends: 2687 [2025-03-03 20:12:08,293 INFO L226 Difference]: Without dead ends: 1720 [2025-03-03 20:12:08,297 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 20:12:08,298 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 296 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:08,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1041 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2025-03-03 20:12:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1714. [2025-03-03 20:12:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1445 states have (on average 1.6498269896193771) internal successors, (2384), 1452 states have internal predecessors, (2384), 260 states have call successors, (260), 8 states have call predecessors, (260), 8 states have return successors, (260), 253 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-03 20:12:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2904 transitions. [2025-03-03 20:12:08,366 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2904 transitions. Word has length 539 [2025-03-03 20:12:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:08,366 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2904 transitions. [2025-03-03 20:12:08,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:08,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2904 transitions. [2025-03-03 20:12:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 20:12:08,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:08,374 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:08,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:12:08,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash -775366605, now seen corresponding path program 1 times [2025-03-03 20:12:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628492120] [2025-03-03 20:12:08,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:08,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:08,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 20:12:08,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 20:12:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:08,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:08,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:08,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628492120] [2025-03-03 20:12:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628492120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:08,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185180274] [2025-03-03 20:12:08,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:08,580 INFO L87 Difference]: Start difference. First operand 1714 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:08,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:08,736 INFO L93 Difference]: Finished difference Result 5136 states and 8706 transitions. [2025-03-03 20:12:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:08,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-03-03 20:12:08,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:08,756 INFO L225 Difference]: With dead ends: 5136 [2025-03-03 20:12:08,756 INFO L226 Difference]: Without dead ends: 3425 [2025-03-03 20:12:08,762 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 20:12:08,763 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 523 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:08,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1110 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2025-03-03 20:12:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3423. [2025-03-03 20:12:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 2886 states have (on average 1.6382536382536383) internal successors, (4728), 2900 states have internal predecessors, (4728), 520 states have call successors, (520), 16 states have call predecessors, (520), 16 states have return successors, (520), 506 states have call predecessors, (520), 520 states have call successors, (520) [2025-03-03 20:12:08,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 5768 transitions. [2025-03-03 20:12:08,915 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 5768 transitions. Word has length 540 [2025-03-03 20:12:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:08,916 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 5768 transitions. [2025-03-03 20:12:08,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 5768 transitions. [2025-03-03 20:12:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 20:12:08,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:08,922 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:08,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:12:08,922 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:08,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 365949076, now seen corresponding path program 1 times [2025-03-03 20:12:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:08,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821077655] [2025-03-03 20:12:08,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:08,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:08,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 20:12:09,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 20:12:09,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:09,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:09,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:09,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821077655] [2025-03-03 20:12:09,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821077655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:09,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584474160] [2025-03-03 20:12:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:09,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:09,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:09,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:09,348 INFO L87 Difference]: Start difference. First operand 3423 states and 5768 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:09,867 INFO L93 Difference]: Finished difference Result 8971 states and 15157 transitions. [2025-03-03 20:12:09,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:09,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-03-03 20:12:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:09,898 INFO L225 Difference]: With dead ends: 8971 [2025-03-03 20:12:09,898 INFO L226 Difference]: Without dead ends: 5551 [2025-03-03 20:12:09,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:09,907 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 609 mSDsluCounter, 1368 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:09,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1881 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2025-03-03 20:12:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 5261. [2025-03-03 20:12:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 4642 states have (on average 1.664584230934942) internal successors, (7727), 4656 states have internal predecessors, (7727), 600 states have call successors, (600), 18 states have call predecessors, (600), 18 states have return successors, (600), 586 states have call predecessors, (600), 600 states have call successors, (600) [2025-03-03 20:12:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 8927 transitions. [2025-03-03 20:12:10,123 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 8927 transitions. Word has length 540 [2025-03-03 20:12:10,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:10,124 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 8927 transitions. [2025-03-03 20:12:10,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 8927 transitions. [2025-03-03 20:12:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 20:12:10,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:10,131 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:10,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:12:10,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:10,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:10,132 INFO L85 PathProgramCache]: Analyzing trace with hash -139609549, now seen corresponding path program 1 times [2025-03-03 20:12:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603581782] [2025-03-03 20:12:10,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:10,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 20:12:10,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 20:12:10,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:10,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:10,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603581782] [2025-03-03 20:12:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603581782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:10,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:10,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:10,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4864723] [2025-03-03 20:12:10,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:10,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:10,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:10,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:10,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:10,649 INFO L87 Difference]: Start difference. First operand 5261 states and 8927 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:11,528 INFO L93 Difference]: Finished difference Result 16689 states and 28299 transitions. [2025-03-03 20:12:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:11,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 540 [2025-03-03 20:12:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:11,589 INFO L225 Difference]: With dead ends: 16689 [2025-03-03 20:12:11,589 INFO L226 Difference]: Without dead ends: 12497 [2025-03-03 20:12:11,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:12:11,605 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 730 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:11,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 2281 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:12:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2025-03-03 20:12:11,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 10457. [2025-03-03 20:12:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10457 states, 9301 states have (on average 1.667347597032577) internal successors, (15508), 9329 states have internal predecessors, (15508), 1120 states have call successors, (1120), 35 states have call predecessors, (1120), 35 states have return successors, (1120), 1092 states have call predecessors, (1120), 1120 states have call successors, (1120) [2025-03-03 20:12:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10457 states to 10457 states and 17748 transitions. [2025-03-03 20:12:12,030 INFO L78 Accepts]: Start accepts. Automaton has 10457 states and 17748 transitions. Word has length 540 [2025-03-03 20:12:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:12,031 INFO L471 AbstractCegarLoop]: Abstraction has 10457 states and 17748 transitions. [2025-03-03 20:12:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 10457 states and 17748 transitions. [2025-03-03 20:12:12,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:12,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:12,041 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:12,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:12:12,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:12,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 852166336, now seen corresponding path program 1 times [2025-03-03 20:12:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523801893] [2025-03-03 20:12:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:12,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:12,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:12,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:12,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523801893] [2025-03-03 20:12:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523801893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:12:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332432586] [2025-03-03 20:12:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:12,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:12:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:12,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:12:12,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:12:12,611 INFO L87 Difference]: Start difference. First operand 10457 states and 17748 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:14,133 INFO L93 Difference]: Finished difference Result 21329 states and 35875 transitions. [2025-03-03 20:12:14,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:12:14,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:14,178 INFO L225 Difference]: With dead ends: 21329 [2025-03-03 20:12:14,179 INFO L226 Difference]: Without dead ends: 13155 [2025-03-03 20:12:14,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:12:14,201 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 1109 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 676 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 676 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:14,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 2084 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [676 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:12:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13155 states. [2025-03-03 20:12:14,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13155 to 10437. [2025-03-03 20:12:14,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10437 states, 9256 states have (on average 1.6502808988764044) internal successors, (15275), 9284 states have internal predecessors, (15275), 1136 states have call successors, (1136), 44 states have call predecessors, (1136), 44 states have return successors, (1136), 1108 states have call predecessors, (1136), 1136 states have call successors, (1136) [2025-03-03 20:12:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10437 states to 10437 states and 17547 transitions. [2025-03-03 20:12:14,638 INFO L78 Accepts]: Start accepts. Automaton has 10437 states and 17547 transitions. Word has length 541 [2025-03-03 20:12:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:14,639 INFO L471 AbstractCegarLoop]: Abstraction has 10437 states and 17547 transitions. [2025-03-03 20:12:14,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10437 states and 17547 transitions. [2025-03-03 20:12:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:14,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:14,648 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:12:14,648 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:14,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 785159583, now seen corresponding path program 1 times [2025-03-03 20:12:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602913594] [2025-03-03 20:12:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:14,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:14,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:14,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:14,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602913594] [2025-03-03 20:12:15,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602913594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:15,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:15,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:12:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829160467] [2025-03-03 20:12:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:15,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:12:15,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:15,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:12:15,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:12:15,184 INFO L87 Difference]: Start difference. First operand 10437 states and 17547 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:16,530 INFO L93 Difference]: Finished difference Result 27633 states and 46194 transitions. [2025-03-03 20:12:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:12:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:16,586 INFO L225 Difference]: With dead ends: 27633 [2025-03-03 20:12:16,587 INFO L226 Difference]: Without dead ends: 19331 [2025-03-03 20:12:16,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:16,634 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1206 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:16,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 1711 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:12:16,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19331 states. [2025-03-03 20:12:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19331 to 15417. [2025-03-03 20:12:17,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15417 states, 13723 states have (on average 1.646724477155141) internal successors, (22598), 13767 states have internal predecessors, (22598), 1628 states have call successors, (1628), 65 states have call predecessors, (1628), 65 states have return successors, (1628), 1584 states have call predecessors, (1628), 1628 states have call successors, (1628) [2025-03-03 20:12:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 25854 transitions. [2025-03-03 20:12:17,317 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 25854 transitions. Word has length 541 [2025-03-03 20:12:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:17,318 INFO L471 AbstractCegarLoop]: Abstraction has 15417 states and 25854 transitions. [2025-03-03 20:12:17,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 25854 transitions. [2025-03-03 20:12:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:17,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:17,330 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:17,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:12:17,331 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:17,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:17,331 INFO L85 PathProgramCache]: Analyzing trace with hash 376335358, now seen corresponding path program 1 times [2025-03-03 20:12:17,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:17,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372979288] [2025-03-03 20:12:17,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:17,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:17,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:17,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:17,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372979288] [2025-03-03 20:12:17,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372979288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:17,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:17,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:17,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35608372] [2025-03-03 20:12:17,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:17,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:17,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:17,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:17,807 INFO L87 Difference]: Start difference. First operand 15417 states and 25854 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:18,461 INFO L93 Difference]: Finished difference Result 24865 states and 41663 transitions. [2025-03-03 20:12:18,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:18,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:18,537 INFO L225 Difference]: With dead ends: 24865 [2025-03-03 20:12:18,538 INFO L226 Difference]: Without dead ends: 18647 [2025-03-03 20:12:18,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:18,560 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 336 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:18,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1284 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:12:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18647 states. [2025-03-03 20:12:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18647 to 15423. [2025-03-03 20:12:19,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15423 states, 13729 states have (on average 1.6464418384441692) internal successors, (22604), 13773 states have internal predecessors, (22604), 1628 states have call successors, (1628), 65 states have call predecessors, (1628), 65 states have return successors, (1628), 1584 states have call predecessors, (1628), 1628 states have call successors, (1628) [2025-03-03 20:12:19,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15423 states to 15423 states and 25860 transitions. [2025-03-03 20:12:19,186 INFO L78 Accepts]: Start accepts. Automaton has 15423 states and 25860 transitions. Word has length 541 [2025-03-03 20:12:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:19,187 INFO L471 AbstractCegarLoop]: Abstraction has 15423 states and 25860 transitions. [2025-03-03 20:12:19,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 15423 states and 25860 transitions. [2025-03-03 20:12:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:19,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:19,199 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:19,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:12:19,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:19,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:19,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1192032875, now seen corresponding path program 1 times [2025-03-03 20:12:19,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:19,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568960464] [2025-03-03 20:12:19,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:19,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:19,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:19,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:19,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:19,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:19,609 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568960464] [2025-03-03 20:12:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568960464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:19,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490838070] [2025-03-03 20:12:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:19,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:19,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:19,612 INFO L87 Difference]: Start difference. First operand 15423 states and 25860 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:20,529 INFO L93 Difference]: Finished difference Result 27499 states and 45993 transitions. [2025-03-03 20:12:20,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:20,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:20,601 INFO L225 Difference]: With dead ends: 27499 [2025-03-03 20:12:20,601 INFO L226 Difference]: Without dead ends: 21821 [2025-03-03 20:12:20,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:20,624 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 338 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:20,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1243 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:12:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21821 states. [2025-03-03 20:12:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21821 to 12033. [2025-03-03 20:12:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12033 states, 10633 states have (on average 1.640270854885733) internal successors, (17441), 10665 states have internal predecessors, (17441), 1340 states have call successors, (1340), 59 states have call predecessors, (1340), 59 states have return successors, (1340), 1308 states have call predecessors, (1340), 1340 states have call successors, (1340) [2025-03-03 20:12:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 20121 transitions. [2025-03-03 20:12:21,293 INFO L78 Accepts]: Start accepts. Automaton has 12033 states and 20121 transitions. Word has length 541 [2025-03-03 20:12:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:21,294 INFO L471 AbstractCegarLoop]: Abstraction has 12033 states and 20121 transitions. [2025-03-03 20:12:21,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12033 states and 20121 transitions. [2025-03-03 20:12:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:21,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:21,306 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:21,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:12:21,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:21,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 525807354, now seen corresponding path program 1 times [2025-03-03 20:12:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028969394] [2025-03-03 20:12:21,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:21,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:21,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:21,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:21,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028969394] [2025-03-03 20:12:21,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028969394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:21,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:21,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:12:21,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785836766] [2025-03-03 20:12:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:21,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:12:21,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:21,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:12:21,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:12:21,468 INFO L87 Difference]: Start difference. First operand 12033 states and 20121 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:22,027 INFO L93 Difference]: Finished difference Result 34809 states and 58285 transitions. [2025-03-03 20:12:22,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:22,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:22,103 INFO L225 Difference]: With dead ends: 34809 [2025-03-03 20:12:22,103 INFO L226 Difference]: Without dead ends: 23435 [2025-03-03 20:12:22,127 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 20:12:22,128 INFO L435 NwaCegarLoop]: 761 mSDtfsCounter, 506 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:22,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1249 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:12:22,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2025-03-03 20:12:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 23381. [2025-03-03 20:12:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23381 states, 20667 states have (on average 1.636328446315382) internal successors, (33818), 20731 states have internal predecessors, (33818), 2600 states have call successors, (2600), 113 states have call predecessors, (2600), 113 states have return successors, (2600), 2536 states have call predecessors, (2600), 2600 states have call successors, (2600) [2025-03-03 20:12:22,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23381 states to 23381 states and 39018 transitions. [2025-03-03 20:12:22,997 INFO L78 Accepts]: Start accepts. Automaton has 23381 states and 39018 transitions. Word has length 541 [2025-03-03 20:12:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:22,998 INFO L471 AbstractCegarLoop]: Abstraction has 23381 states and 39018 transitions. [2025-03-03 20:12:22,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 23381 states and 39018 transitions. [2025-03-03 20:12:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-03 20:12:23,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:23,011 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:23,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:12:23,011 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:23,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash -209900288, now seen corresponding path program 1 times [2025-03-03 20:12:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:23,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412883076] [2025-03-03 20:12:23,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:23,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:23,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-03 20:12:23,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-03 20:12:23,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:23,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:23,559 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:23,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:23,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412883076] [2025-03-03 20:12:23,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412883076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:23,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:23,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:23,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390073654] [2025-03-03 20:12:23,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:23,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:23,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:23,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:23,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:23,562 INFO L87 Difference]: Start difference. First operand 23381 states and 39018 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:24,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:24,529 INFO L93 Difference]: Finished difference Result 59437 states and 99078 transitions. [2025-03-03 20:12:24,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:12:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 541 [2025-03-03 20:12:24,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:24,643 INFO L225 Difference]: With dead ends: 59437 [2025-03-03 20:12:24,643 INFO L226 Difference]: Without dead ends: 43135 [2025-03-03 20:12:24,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:24,683 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 257 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:24,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1507 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:12:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43135 states. [2025-03-03 20:12:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43135 to 43097. [2025-03-03 20:12:26,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43097 states, 38871 states have (on average 1.642252579043503) internal successors, (63836), 39007 states have internal predecessors, (63836), 4040 states have call successors, (4040), 185 states have call predecessors, (4040), 185 states have return successors, (4040), 3904 states have call predecessors, (4040), 4040 states have call successors, (4040) [2025-03-03 20:12:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43097 states to 43097 states and 71916 transitions. [2025-03-03 20:12:26,408 INFO L78 Accepts]: Start accepts. Automaton has 43097 states and 71916 transitions. Word has length 541 [2025-03-03 20:12:26,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:26,409 INFO L471 AbstractCegarLoop]: Abstraction has 43097 states and 71916 transitions. [2025-03-03 20:12:26,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 43097 states and 71916 transitions. [2025-03-03 20:12:26,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-03 20:12:26,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:26,434 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 20:12:26,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1825032672, now seen corresponding path program 1 times [2025-03-03 20:12:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955533035] [2025-03-03 20:12:26,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:26,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-03 20:12:26,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 20:12:26,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:26,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:27,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955533035] [2025-03-03 20:12:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955533035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:27,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:27,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:27,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756933623] [2025-03-03 20:12:27,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:27,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:27,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:27,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:27,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:27,050 INFO L87 Difference]: Start difference. First operand 43097 states and 71916 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:29,775 INFO L93 Difference]: Finished difference Result 125931 states and 209999 transitions. [2025-03-03 20:12:29,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:29,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-03-03 20:12:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:29,983 INFO L225 Difference]: With dead ends: 125931 [2025-03-03 20:12:29,984 INFO L226 Difference]: Without dead ends: 88605 [2025-03-03 20:12:30,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:30,039 INFO L435 NwaCegarLoop]: 732 mSDtfsCounter, 662 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:30,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1844 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:30,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88605 states. [2025-03-03 20:12:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88605 to 45833. [2025-03-03 20:12:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45833 states, 41607 states have (on average 1.6369360924844376) internal successors, (68108), 41743 states have internal predecessors, (68108), 4040 states have call successors, (4040), 185 states have call predecessors, (4040), 185 states have return successors, (4040), 3904 states have call predecessors, (4040), 4040 states have call successors, (4040) [2025-03-03 20:12:32,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45833 states to 45833 states and 76188 transitions. [2025-03-03 20:12:32,084 INFO L78 Accepts]: Start accepts. Automaton has 45833 states and 76188 transitions. Word has length 542 [2025-03-03 20:12:32,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:32,084 INFO L471 AbstractCegarLoop]: Abstraction has 45833 states and 76188 transitions. [2025-03-03 20:12:32,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 45833 states and 76188 transitions. [2025-03-03 20:12:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-03 20:12:32,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:32,112 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 20:12:32,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:32,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash -462206178, now seen corresponding path program 1 times [2025-03-03 20:12:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957165698] [2025-03-03 20:12:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:32,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-03 20:12:32,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 20:12:32,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:32,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:32,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:32,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957165698] [2025-03-03 20:12:32,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957165698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:32,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:32,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:12:32,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930076366] [2025-03-03 20:12:32,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:32,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:12:32,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:32,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:12:32,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:32,320 INFO L87 Difference]: Start difference. First operand 45833 states and 76188 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:35,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:35,792 INFO L93 Difference]: Finished difference Result 129035 states and 214123 transitions. [2025-03-03 20:12:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:12:35,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-03-03 20:12:35,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:35,989 INFO L225 Difference]: With dead ends: 129035 [2025-03-03 20:12:35,990 INFO L226 Difference]: Without dead ends: 86373 [2025-03-03 20:12:36,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:12:36,040 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 689 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:36,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1451 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:12:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86373 states. [2025-03-03 20:12:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86373 to 16875. [2025-03-03 20:12:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16875 states, 15265 states have (on average 1.6335407795610875) internal successors, (24936), 15309 states have internal predecessors, (24936), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-03-03 20:12:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16875 states to 16875 states and 28000 transitions. [2025-03-03 20:12:37,694 INFO L78 Accepts]: Start accepts. Automaton has 16875 states and 28000 transitions. Word has length 542 [2025-03-03 20:12:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:37,695 INFO L471 AbstractCegarLoop]: Abstraction has 16875 states and 28000 transitions. [2025-03-03 20:12:37,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 16875 states and 28000 transitions. [2025-03-03 20:12:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-03 20:12:37,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:37,704 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 20:12:37,705 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -945386927, now seen corresponding path program 1 times [2025-03-03 20:12:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468628160] [2025-03-03 20:12:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:37,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-03 20:12:37,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 20:12:37,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:37,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:37,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:37,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468628160] [2025-03-03 20:12:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468628160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:37,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571599544] [2025-03-03 20:12:37,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:37,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:37,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:37,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:37,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:37,979 INFO L87 Difference]: Start difference. First operand 16875 states and 28000 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:40,392 INFO L93 Difference]: Finished difference Result 49041 states and 81186 transitions. [2025-03-03 20:12:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:12:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-03-03 20:12:40,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:40,488 INFO L225 Difference]: With dead ends: 49041 [2025-03-03 20:12:40,488 INFO L226 Difference]: Without dead ends: 35297 [2025-03-03 20:12:40,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:12:40,520 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 1349 mSDsluCounter, 2231 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2970 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:40,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2970 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35297 states. [2025-03-03 20:12:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35297 to 17143. [2025-03-03 20:12:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17143 states, 15533 states have (on average 1.633940642503058) internal successors, (25380), 15577 states have internal predecessors, (25380), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-03-03 20:12:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17143 states to 17143 states and 28444 transitions. [2025-03-03 20:12:41,543 INFO L78 Accepts]: Start accepts. Automaton has 17143 states and 28444 transitions. Word has length 542 [2025-03-03 20:12:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:41,544 INFO L471 AbstractCegarLoop]: Abstraction has 17143 states and 28444 transitions. [2025-03-03 20:12:41,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 17143 states and 28444 transitions. [2025-03-03 20:12:41,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-03 20:12:41,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:41,552 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:41,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 20:12:41,552 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:41,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2112083246, now seen corresponding path program 1 times [2025-03-03 20:12:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:41,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040189710] [2025-03-03 20:12:41,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:41,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-03 20:12:41,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-03 20:12:41,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:41,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:41,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040189710] [2025-03-03 20:12:41,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040189710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:41,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:41,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:12:41,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227637572] [2025-03-03 20:12:41,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:41,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:12:41,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:41,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:12:41,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:41,877 INFO L87 Difference]: Start difference. First operand 17143 states and 28444 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:12:43,743 INFO L93 Difference]: Finished difference Result 47987 states and 79520 transitions. [2025-03-03 20:12:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:12:43,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 542 [2025-03-03 20:12:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:12:43,820 INFO L225 Difference]: With dead ends: 47987 [2025-03-03 20:12:43,821 INFO L226 Difference]: Without dead ends: 34335 [2025-03-03 20:12:43,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:12:43,852 INFO L435 NwaCegarLoop]: 966 mSDtfsCounter, 940 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:12:43,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 2836 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:12:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34335 states. [2025-03-03 20:12:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34335 to 17275. [2025-03-03 20:12:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17275 states, 15665 states have (on average 1.6308969039259495) internal successors, (25548), 15709 states have internal predecessors, (25548), 1532 states have call successors, (1532), 77 states have call predecessors, (1532), 77 states have return successors, (1532), 1488 states have call predecessors, (1532), 1532 states have call successors, (1532) [2025-03-03 20:12:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17275 states to 17275 states and 28612 transitions. [2025-03-03 20:12:44,764 INFO L78 Accepts]: Start accepts. Automaton has 17275 states and 28612 transitions. Word has length 542 [2025-03-03 20:12:44,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:12:44,765 INFO L471 AbstractCegarLoop]: Abstraction has 17275 states and 28612 transitions. [2025-03-03 20:12:44,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 20:12:44,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17275 states and 28612 transitions. [2025-03-03 20:12:44,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 20:12:44,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:44,772 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:12:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 20:12:44,773 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:44,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -841918524, now seen corresponding path program 1 times [2025-03-03 20:12:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746459711] [2025-03-03 20:12:44,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:44,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 20:12:45,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 20:12:45,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:45,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:48,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 20:12:48,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:48,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746459711] [2025-03-03 20:12:48,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746459711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:12:48,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:12:48,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 20:12:48,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855557075] [2025-03-03 20:12:48,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:12:48,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 20:12:48,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:12:48,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 20:12:48,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:12:48,095 INFO L87 Difference]: Start difference. First operand 17275 states and 28612 transitions. Second operand has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-03-03 20:13:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:05,835 INFO L93 Difference]: Finished difference Result 125035 states and 205470 transitions. [2025-03-03 20:13:05,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 20:13:05,836 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 543 [2025-03-03 20:13:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:06,053 INFO L225 Difference]: With dead ends: 125035 [2025-03-03 20:13:06,053 INFO L226 Difference]: Without dead ends: 112375 [2025-03-03 20:13:06,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=389, Invalid=871, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 20:13:06,089 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 15642 mSDsluCounter, 5262 mSDsCounter, 0 mSdLazyCounter, 6023 mSolverCounterSat, 3478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15642 SdHoareTripleChecker+Valid, 5958 SdHoareTripleChecker+Invalid, 9501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3478 IncrementalHoareTripleChecker+Valid, 6023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:06,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15642 Valid, 5958 Invalid, 9501 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3478 Valid, 6023 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2025-03-03 20:13:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112375 states. [2025-03-03 20:13:10,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112375 to 60489. [2025-03-03 20:13:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60489 states, 54102 states have (on average 1.6105134745480758) internal successors, (87132), 54334 states have internal predecessors, (87132), 6080 states have call successors, (6080), 306 states have call predecessors, (6080), 306 states have return successors, (6080), 5848 states have call predecessors, (6080), 6080 states have call successors, (6080) [2025-03-03 20:13:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60489 states to 60489 states and 99292 transitions. [2025-03-03 20:13:10,922 INFO L78 Accepts]: Start accepts. Automaton has 60489 states and 99292 transitions. Word has length 543 [2025-03-03 20:13:10,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:10,923 INFO L471 AbstractCegarLoop]: Abstraction has 60489 states and 99292 transitions. [2025-03-03 20:13:10,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.11111111111111) internal successors, (146), 18 states have internal predecessors, (146), 3 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2025-03-03 20:13:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 60489 states and 99292 transitions. [2025-03-03 20:13:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 20:13:10,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:10,948 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:13:10,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 20:13:10,948 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:10,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1778600924, now seen corresponding path program 1 times [2025-03-03 20:13:10,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:10,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478649435] [2025-03-03 20:13:10,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:10,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:10,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 20:13:11,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 20:13:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat