./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.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 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:41:26,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:41:26,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:41:26,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:41:26,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:41:26,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:41:26,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:41:26,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:41:26,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:41:26,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:41:26,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:41:26,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:41:26,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:41:26,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:41:26,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:41:26,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:41:26,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:41:26,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:41:26,596 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 -> 47dd68ea39604b487f233f68e029f640f8a21785e687328515d4ba55c65777c4 [2025-03-17 00:41:26,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:41:26,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:41:26,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:41:26,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:41:26,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:41:26,862 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-50_file-81.i [2025-03-17 00:41:28,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62aeb0b66/3eb8beaffe0b478899f951a2c2d8f2ef/FLAG19d1d7b82 [2025-03-17 00:41:28,303 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:41:28,305 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2025-03-17 00:41:28,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62aeb0b66/3eb8beaffe0b478899f951a2c2d8f2ef/FLAG19d1d7b82 [2025-03-17 00:41:28,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62aeb0b66/3eb8beaffe0b478899f951a2c2d8f2ef [2025-03-17 00:41:28,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:41:28,333 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:41:28,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:41:28,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:41:28,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:41:28,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781d8a73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28, skipping insertion in model container [2025-03-17 00:41:28,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,368 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:41:28,473 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-50_file-81.i[915,928] [2025-03-17 00:41:28,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:41:28,582 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:41:28,593 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-50_file-81.i[915,928] [2025-03-17 00:41:28,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:41:28,653 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:41:28,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28 WrapperNode [2025-03-17 00:41:28,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:41:28,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:41:28,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:41:28,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:41:28,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,716 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 305 [2025-03-17 00:41:28,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:41:28,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:41:28,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:41:28,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:41:28,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,750 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-17 00:41:28,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,751 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,762 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:41:28,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:41:28,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:41:28,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:41:28,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (1/1) ... [2025-03-17 00:41:28,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:41:28,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:41:28,796 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-17 00:41:28,799 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-17 00:41:28,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:41:28,817 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:41:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:41:28,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:41:28,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:41:28,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:41:28,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:41:28,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:41:29,290 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-17 00:41:29,338 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 00:41:29,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:41:29,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:41:29,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:41:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:41:29 BoogieIcfgContainer [2025-03-17 00:41:29,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:41:29,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:41:29,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:41:29,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:41:29,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:41:28" (1/3) ... [2025-03-17 00:41:29,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aff89a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:41:29, skipping insertion in model container [2025-03-17 00:41:29,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:41:28" (2/3) ... [2025-03-17 00:41:29,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aff89a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:41:29, skipping insertion in model container [2025-03-17 00:41:29,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:41:29" (3/3) ... [2025-03-17 00:41:29,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-81.i [2025-03-17 00:41:29,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:41:29,400 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-81.i that has 2 procedures, 129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:41:29,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:41:29,451 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;@719e0c8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:41:29,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:41:29,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 00:41:29,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 00:41:29,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:29,473 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:29,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:29,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash 993175149, now seen corresponding path program 1 times [2025-03-17 00:41:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006647322] [2025-03-17 00:41:29,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:29,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:29,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 00:41:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 00:41:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 00:41:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:29,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006647322] [2025-03-17 00:41:29,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006647322] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:41:29,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268725900] [2025-03-17 00:41:29,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:41:29,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:41:29,832 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-17 00:41:29,833 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-17 00:41:29,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 00:41:30,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 00:41:30,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:30,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:30,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:41:30,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:41:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-17 00:41:30,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:41:30,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268725900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:30,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:41:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:41:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028851379] [2025-03-17 00:41:30,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:30,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:41:30,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:30,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:41:30,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:41:30,110 INFO L87 Difference]: Start difference. First operand has 129 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 00:41:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:30,145 INFO L93 Difference]: Finished difference Result 255 states and 466 transitions. [2025-03-17 00:41:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:41:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 303 [2025-03-17 00:41:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:30,152 INFO L225 Difference]: With dead ends: 255 [2025-03-17 00:41:30,152 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 00:41:30,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 304 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-17 00:41:30,157 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:30,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:41:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 00:41:30,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-17 00:41:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-17 00:41:30,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 205 transitions. [2025-03-17 00:41:30,200 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 205 transitions. Word has length 303 [2025-03-17 00:41:30,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:30,201 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 205 transitions. [2025-03-17 00:41:30,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 00:41:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 205 transitions. [2025-03-17 00:41:30,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-17 00:41:30,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:30,205 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:30,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:41:30,405 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-17 00:41:30,406 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:30,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1425824329, now seen corresponding path program 1 times [2025-03-17 00:41:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:30,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773395620] [2025-03-17 00:41:30,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:30,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-17 00:41:30,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-17 00:41:30,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:30,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:31,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:41:31,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:31,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773395620] [2025-03-17 00:41:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773395620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:31,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:41:31,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:41:31,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724366656] [2025-03-17 00:41:31,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:31,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:41:31,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:31,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:41:31,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:41:31,146 INFO L87 Difference]: Start difference. First operand 127 states and 205 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:31,429 INFO L93 Difference]: Finished difference Result 380 states and 615 transitions. [2025-03-17 00:41:31,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:41:31,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 303 [2025-03-17 00:41:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:31,438 INFO L225 Difference]: With dead ends: 380 [2025-03-17 00:41:31,438 INFO L226 Difference]: Without dead ends: 254 [2025-03-17 00:41:31,439 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-17 00:41:31,440 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 122 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:31,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 483 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:41:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-17 00:41:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2025-03-17 00:41:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 00:41:31,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 409 transitions. [2025-03-17 00:41:31,499 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 409 transitions. Word has length 303 [2025-03-17 00:41:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:31,501 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 409 transitions. [2025-03-17 00:41:31,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 409 transitions. [2025-03-17 00:41:31,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:41:31,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:31,505 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:31,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:41:31,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:31,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:31,506 INFO L85 PathProgramCache]: Analyzing trace with hash 500413534, now seen corresponding path program 1 times [2025-03-17 00:41:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:31,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502369155] [2025-03-17 00:41:31,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:31,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:31,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:41:31,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:41:31,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:31,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:31,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:41:31,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:31,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502369155] [2025-03-17 00:41:31,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502369155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:31,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:41:31,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:41:31,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48394168] [2025-03-17 00:41:31,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:31,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:41:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:31,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:41:31,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:41:31,948 INFO L87 Difference]: Start difference. First operand 252 states and 409 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:32,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:32,043 INFO L93 Difference]: Finished difference Result 569 states and 912 transitions. [2025-03-17 00:41:32,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:41:32,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 00:41:32,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:32,047 INFO L225 Difference]: With dead ends: 569 [2025-03-17 00:41:32,047 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 00:41:32,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:41:32,049 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 41 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:32,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 591 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:41:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 00:41:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2025-03-17 00:41:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 201 states have (on average 1.3980099502487562) internal successors, (281), 203 states have internal predecessors, (281), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-17 00:41:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 497 transitions. [2025-03-17 00:41:32,106 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 497 transitions. Word has length 304 [2025-03-17 00:41:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:32,108 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 497 transitions. [2025-03-17 00:41:32,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 497 transitions. [2025-03-17 00:41:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:41:32,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:32,113 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:32,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:41:32,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:32,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:32,114 INFO L85 PathProgramCache]: Analyzing trace with hash 696927039, now seen corresponding path program 1 times [2025-03-17 00:41:32,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:32,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466666410] [2025-03-17 00:41:32,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:32,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:32,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:41:32,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:41:32,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:32,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:41:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:40,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466666410] [2025-03-17 00:41:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466666410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:40,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:41:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:41:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857937524] [2025-03-17 00:41:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:40,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:41:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:40,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:41:40,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:41:40,014 INFO L87 Difference]: Start difference. First operand 314 states and 497 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:42,079 INFO L93 Difference]: Finished difference Result 998 states and 1548 transitions. [2025-03-17 00:41:42,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:41:42,080 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 00:41:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:42,085 INFO L225 Difference]: With dead ends: 998 [2025-03-17 00:41:42,086 INFO L226 Difference]: Without dead ends: 685 [2025-03-17 00:41:42,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:41:42,088 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 590 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:42,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1120 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:41:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-17 00:41:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 461. [2025-03-17 00:41:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 299 states have internal predecessors, (421), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 00:41:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 737 transitions. [2025-03-17 00:41:42,138 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 737 transitions. Word has length 304 [2025-03-17 00:41:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:42,139 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 737 transitions. [2025-03-17 00:41:42,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 737 transitions. [2025-03-17 00:41:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:41:42,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:42,141 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:42,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:41:42,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:42,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:42,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1100024320, now seen corresponding path program 1 times [2025-03-17 00:41:42,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738837181] [2025-03-17 00:41:42,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:42,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:41:42,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:41:42,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:42,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:41:49,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:49,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738837181] [2025-03-17 00:41:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738837181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:49,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:41:49,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:41:49,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244004512] [2025-03-17 00:41:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:49,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:41:49,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:49,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:41:49,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:41:49,660 INFO L87 Difference]: Start difference. First operand 461 states and 737 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:52,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:52,214 INFO L93 Difference]: Finished difference Result 978 states and 1521 transitions. [2025-03-17 00:41:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:41:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 00:41:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:52,219 INFO L225 Difference]: With dead ends: 978 [2025-03-17 00:41:52,220 INFO L226 Difference]: Without dead ends: 665 [2025-03-17 00:41:52,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:41:52,222 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 510 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:52,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1115 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:41:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-17 00:41:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 461. [2025-03-17 00:41:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 297 states have (on average 1.4175084175084176) internal successors, (421), 299 states have internal predecessors, (421), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 00:41:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 737 transitions. [2025-03-17 00:41:52,288 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 737 transitions. Word has length 304 [2025-03-17 00:41:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:52,289 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 737 transitions. [2025-03-17 00:41:52,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:41:52,290 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 737 transitions. [2025-03-17 00:41:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:41:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:52,291 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:41:52,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash 826009758, now seen corresponding path program 1 times [2025-03-17 00:41:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472914185] [2025-03-17 00:41:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:52,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:52,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:41:52,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:41:52,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:52,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:41:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:41:53,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:41:53,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472914185] [2025-03-17 00:41:53,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472914185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:41:53,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:41:53,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:41:53,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592708694] [2025-03-17 00:41:53,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:41:53,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:41:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:41:53,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:41:53,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:41:53,375 INFO L87 Difference]: Start difference. First operand 461 states and 737 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 00:41:54,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:41:54,110 INFO L93 Difference]: Finished difference Result 944 states and 1483 transitions. [2025-03-17 00:41:54,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 00:41:54,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 304 [2025-03-17 00:41:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:41:54,115 INFO L225 Difference]: With dead ends: 944 [2025-03-17 00:41:54,115 INFO L226 Difference]: Without dead ends: 631 [2025-03-17 00:41:54,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:41:54,117 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 339 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:41:54,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 1061 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 00:41:54,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2025-03-17 00:41:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 473. [2025-03-17 00:41:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 309 states have (on average 1.4077669902912622) internal successors, (435), 311 states have internal predecessors, (435), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 00:41:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 751 transitions. [2025-03-17 00:41:54,161 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 751 transitions. Word has length 304 [2025-03-17 00:41:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:41:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 751 transitions. [2025-03-17 00:41:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-17 00:41:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 751 transitions. [2025-03-17 00:41:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:41:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:41:54,164 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:41:54,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:41:54,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:41:54,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:41:54,165 INFO L85 PathProgramCache]: Analyzing trace with hash 191368414, now seen corresponding path program 1 times [2025-03-17 00:41:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:41:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231266968] [2025-03-17 00:41:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:41:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:41:54,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:41:54,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:41:54,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:41:54,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231266968] [2025-03-17 00:42:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231266968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:01,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:42:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222026437] [2025-03-17 00:42:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:01,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:42:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:01,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:42:01,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:42:01,508 INFO L87 Difference]: Start difference. First operand 473 states and 751 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:03,516 INFO L93 Difference]: Finished difference Result 962 states and 1494 transitions. [2025-03-17 00:42:03,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:42:03,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 00:42:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:03,521 INFO L225 Difference]: With dead ends: 962 [2025-03-17 00:42:03,522 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 00:42:03,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:42:03,523 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 325 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:03,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 1088 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:42:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 00:42:03,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 475. [2025-03-17 00:42:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 311 states have (on average 1.4115755627009647) internal successors, (439), 313 states have internal predecessors, (439), 158 states have call successors, (158), 5 states have call predecessors, (158), 5 states have return successors, (158), 156 states have call predecessors, (158), 158 states have call successors, (158) [2025-03-17 00:42:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 755 transitions. [2025-03-17 00:42:03,567 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 755 transitions. Word has length 304 [2025-03-17 00:42:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 755 transitions. [2025-03-17 00:42:03,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 755 transitions. [2025-03-17 00:42:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-03-17 00:42:03,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:03,571 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:03,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:42:03,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:03,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1605582945, now seen corresponding path program 1 times [2025-03-17 00:42:03,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:03,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740843519] [2025-03-17 00:42:03,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:03,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-03-17 00:42:03,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-03-17 00:42:03,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:03,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740843519] [2025-03-17 00:42:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740843519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:42:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507449819] [2025-03-17 00:42:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:10,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:42:10,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:10,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:42:10,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:42:10,679 INFO L87 Difference]: Start difference. First operand 475 states and 755 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:13,354 INFO L93 Difference]: Finished difference Result 1251 states and 1958 transitions. [2025-03-17 00:42:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:42:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 304 [2025-03-17 00:42:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:13,360 INFO L225 Difference]: With dead ends: 1251 [2025-03-17 00:42:13,360 INFO L226 Difference]: Without dead ends: 938 [2025-03-17 00:42:13,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:42:13,362 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 313 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:13,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1060 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 00:42:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-03-17 00:42:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 780. [2025-03-17 00:42:13,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 504 states have (on average 1.4087301587301588) internal successors, (710), 508 states have internal predecessors, (710), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1242 transitions. [2025-03-17 00:42:13,441 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1242 transitions. Word has length 304 [2025-03-17 00:42:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:13,442 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1242 transitions. [2025-03-17 00:42:13,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1242 transitions. [2025-03-17 00:42:13,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:13,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:13,445 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:13,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:42:13,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:13,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:13,446 INFO L85 PathProgramCache]: Analyzing trace with hash -354156596, now seen corresponding path program 1 times [2025-03-17 00:42:13,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365960063] [2025-03-17 00:42:13,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:13,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:13,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:13,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:13,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:13,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:21,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:21,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365960063] [2025-03-17 00:42:21,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365960063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:21,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:21,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:42:21,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201055996] [2025-03-17 00:42:21,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:21,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:42:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:21,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:42:21,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:42:21,043 INFO L87 Difference]: Start difference. First operand 780 states and 1242 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:21,524 INFO L93 Difference]: Finished difference Result 1427 states and 2222 transitions. [2025-03-17 00:42:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:42:21,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 00:42:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:21,531 INFO L225 Difference]: With dead ends: 1427 [2025-03-17 00:42:21,531 INFO L226 Difference]: Without dead ends: 1114 [2025-03-17 00:42:21,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:42:21,534 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 261 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:21,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 790 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:42:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-03-17 00:42:21,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 812. [2025-03-17 00:42:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 536 states have (on average 1.4179104477611941) internal successors, (760), 540 states have internal predecessors, (760), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1292 transitions. [2025-03-17 00:42:21,608 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1292 transitions. Word has length 305 [2025-03-17 00:42:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:21,609 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1292 transitions. [2025-03-17 00:42:21,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1292 transitions. [2025-03-17 00:42:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:21,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:21,611 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:21,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:42:21,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -157643091, now seen corresponding path program 1 times [2025-03-17 00:42:21,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367685682] [2025-03-17 00:42:21,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:21,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:21,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:21,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:21,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:26,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367685682] [2025-03-17 00:42:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367685682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:42:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478804274] [2025-03-17 00:42:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:26,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:42:26,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:26,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:42:26,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:42:26,494 INFO L87 Difference]: Start difference. First operand 812 states and 1292 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:28,432 INFO L93 Difference]: Finished difference Result 1609 states and 2479 transitions. [2025-03-17 00:42:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:42:28,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 00:42:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:28,439 INFO L225 Difference]: With dead ends: 1609 [2025-03-17 00:42:28,439 INFO L226 Difference]: Without dead ends: 1270 [2025-03-17 00:42:28,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:42:28,441 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 518 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:28,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1118 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:42:28,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-03-17 00:42:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 820. [2025-03-17 00:42:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:28,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 00:42:28,516 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 00:42:28,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:28,516 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 00:42:28,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 00:42:28,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:28,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:28,519 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:28,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:42:28,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:28,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2143859341, now seen corresponding path program 1 times [2025-03-17 00:42:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:28,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854817940] [2025-03-17 00:42:28,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:28,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:28,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:28,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:28,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854817940] [2025-03-17 00:42:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854817940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 00:42:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396740457] [2025-03-17 00:42:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:32,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 00:42:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:32,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 00:42:32,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:42:32,855 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:33,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:33,417 INFO L93 Difference]: Finished difference Result 1423 states and 2219 transitions. [2025-03-17 00:42:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:42:33,418 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 00:42:33,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:33,423 INFO L225 Difference]: With dead ends: 1423 [2025-03-17 00:42:33,423 INFO L226 Difference]: Without dead ends: 1084 [2025-03-17 00:42:33,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:42:33,425 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 176 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 921 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:42:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2025-03-17 00:42:33,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 820. [2025-03-17 00:42:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 00:42:33,495 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 00:42:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:33,495 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 00:42:33,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:33,496 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 00:42:33,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:33,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:33,497 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:33,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:42:33,497 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:33,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:33,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1954594450, now seen corresponding path program 1 times [2025-03-17 00:42:33,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:33,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989792264] [2025-03-17 00:42:33,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:33,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:33,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:33,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:33,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:33,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:38,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:38,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989792264] [2025-03-17 00:42:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989792264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:38,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:42:38,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900793986] [2025-03-17 00:42:38,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:38,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:42:38,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:38,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:42:38,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:42:38,266 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:42,496 INFO L93 Difference]: Finished difference Result 1559 states and 2398 transitions. [2025-03-17 00:42:42,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 00:42:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 00:42:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:42,502 INFO L225 Difference]: With dead ends: 1559 [2025-03-17 00:42:42,502 INFO L226 Difference]: Without dead ends: 1220 [2025-03-17 00:42:42,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:42:42,505 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 432 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:42,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1254 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:42:42,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-03-17 00:42:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 820. [2025-03-17 00:42:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 544 states have (on average 1.4191176470588236) internal successors, (772), 548 states have internal predecessors, (772), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1304 transitions. [2025-03-17 00:42:42,580 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1304 transitions. Word has length 305 [2025-03-17 00:42:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:42,582 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1304 transitions. [2025-03-17 00:42:42,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1304 transitions. [2025-03-17 00:42:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:42,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:42,584 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:42:42,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:42,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash -663201716, now seen corresponding path program 1 times [2025-03-17 00:42:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:42,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633508302] [2025-03-17 00:42:42,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:42,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:42,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:42,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:42,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:42:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-17 00:42:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:42:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633508302] [2025-03-17 00:42:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633508302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:42:47,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:42:47,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 00:42:47,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433001079] [2025-03-17 00:42:47,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:42:47,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:42:47,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:42:47,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:42:47,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:42:47,729 INFO L87 Difference]: Start difference. First operand 820 states and 1304 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:42:49,461 INFO L93 Difference]: Finished difference Result 1499 states and 2322 transitions. [2025-03-17 00:42:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 00:42:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 305 [2025-03-17 00:42:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:42:49,467 INFO L225 Difference]: With dead ends: 1499 [2025-03-17 00:42:49,467 INFO L226 Difference]: Without dead ends: 1160 [2025-03-17 00:42:49,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-17 00:42:49,468 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 457 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:42:49,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1103 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 00:42:49,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-03-17 00:42:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 822. [2025-03-17 00:42:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 546 states have (on average 1.4212454212454213) internal successors, (776), 550 states have internal predecessors, (776), 266 states have call successors, (266), 9 states have call predecessors, (266), 9 states have return successors, (266), 262 states have call predecessors, (266), 266 states have call successors, (266) [2025-03-17 00:42:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1308 transitions. [2025-03-17 00:42:49,539 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1308 transitions. Word has length 305 [2025-03-17 00:42:49,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:42:49,539 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1308 transitions. [2025-03-17 00:42:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-17 00:42:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1308 transitions. [2025-03-17 00:42:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-03-17 00:42:49,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:42:49,542 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:42:49,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:42:49,542 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:42:49,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:42:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1834814221, now seen corresponding path program 1 times [2025-03-17 00:42:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:42:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616050452] [2025-03-17 00:42:49,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:42:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:42:49,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-03-17 00:42:49,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-03-17 00:42:49,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:42:49,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat