./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-56.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 1294b8a15f94b3cb1e5cc1cab22125a388a743f77b9c1cf279de0f76ef77494d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:03:24,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:03:24,652 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:03:24,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:03:24,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:03:24,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:03:24,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:03:24,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:03:24,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:03:24,684 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:03:24,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:03:24,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:03:24,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:03:24,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:03:24,685 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:03:24,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:03:24,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:03:24,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:03:24,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:03:24,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:03:24,687 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:03:24,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:03:24,688 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 -> 1294b8a15f94b3cb1e5cc1cab22125a388a743f77b9c1cf279de0f76ef77494d [2025-03-03 22:03:24,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:03:24,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:03:24,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:03:24,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:03:24,935 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:03:24,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-56.i [2025-03-03 22:03:26,062 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475c8a6d5/0f975f4088444856ab0016278a42c569/FLAGf520a060f [2025-03-03 22:03:26,293 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:03:26,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-56.i [2025-03-03 22:03:26,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475c8a6d5/0f975f4088444856ab0016278a42c569/FLAGf520a060f [2025-03-03 22:03:26,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/475c8a6d5/0f975f4088444856ab0016278a42c569 [2025-03-03 22:03:26,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:03:26,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:03:26,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:03:26,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:03:26,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:03:26,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc30995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26, skipping insertion in model container [2025-03-03 22:03:26,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:03:26,433 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_fillercodestructure_filler-ps-co_file-56.i[919,932] [2025-03-03 22:03:26,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:03:26,498 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:03:26,505 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_fillercodestructure_filler-ps-co_file-56.i[919,932] [2025-03-03 22:03:26,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:03:26,555 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:03:26,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26 WrapperNode [2025-03-03 22:03:26,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:03:26,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:03:26,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:03:26,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:03:26,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,600 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2025-03-03 22:03:26,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:03:26,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:03:26,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:03:26,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:03:26,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:03:26,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:03:26,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:03:26,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:03:26,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:03:26,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (1/1) ... [2025-03-03 22:03:26,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:03:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:03:26,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:03:26,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:03:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:03:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:03:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:03:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:03:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:03:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:03:26,762 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:03:26,764 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:03:27,192 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 22:03:27,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:03:27,227 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:03:27,227 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:03:27,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:03:27 BoogieIcfgContainer [2025-03-03 22:03:27,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:03:27,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:03:27,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:03:27,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:03:27,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:03:26" (1/3) ... [2025-03-03 22:03:27,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:03:27, skipping insertion in model container [2025-03-03 22:03:27,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:03:26" (2/3) ... [2025-03-03 22:03:27,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b8bda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:03:27, skipping insertion in model container [2025-03-03 22:03:27,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:03:27" (3/3) ... [2025-03-03 22:03:27,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-56.i [2025-03-03 22:03:27,247 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:03:27,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-56.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:03:27,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:03:27,305 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;@36f3a426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:03:27,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:03:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 22:03:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 22:03:27,321 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:27,322 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:27,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:27,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1558451094, now seen corresponding path program 1 times [2025-03-03 22:03:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412105737] [2025-03-03 22:03:27,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:27,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 22:03:27,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 22:03:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 22:03:27,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412105737] [2025-03-03 22:03:27,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412105737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:03:27,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713717678] [2025-03-03 22:03:27,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:27,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:03:27,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:03:27,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:03:27,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:03:27,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 22:03:27,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 22:03:27,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:27,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:03:27,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:03:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-03 22:03:27,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:03:27,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713717678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:27,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:03:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:03:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123627399] [2025-03-03 22:03:27,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:27,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:03:27,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:27,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:03:27,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:03:27,869 INFO L87 Difference]: Start difference. First operand has 96 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:03:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:27,894 INFO L93 Difference]: Finished difference Result 186 states and 329 transitions. [2025-03-03 22:03:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:03:27,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2025-03-03 22:03:27,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:27,902 INFO L225 Difference]: With dead ends: 186 [2025-03-03 22:03:27,902 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 22:03:27,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:03:27,907 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:27,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:03:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 22:03:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 22:03:27,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 22:03:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2025-03-03 22:03:27,941 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 215 [2025-03-03 22:03:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:27,942 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2025-03-03 22:03:27,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-03 22:03:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2025-03-03 22:03:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 22:03:27,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:27,945 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:27,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:03:28,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:03:28,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:28,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:28,147 INFO L85 PathProgramCache]: Analyzing trace with hash -572121658, now seen corresponding path program 1 times [2025-03-03 22:03:28,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:28,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127089686] [2025-03-03 22:03:28,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:28,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 22:03:28,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 22:03:28,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:28,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 22:03:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127089686] [2025-03-03 22:03:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127089686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:28,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:03:28,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:03:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538424489] [2025-03-03 22:03:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:28,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:03:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:28,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:03:28,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:28,466 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:28,538 INFO L93 Difference]: Finished difference Result 264 states and 417 transitions. [2025-03-03 22:03:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:03:28,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-03 22:03:28,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:28,543 INFO L225 Difference]: With dead ends: 264 [2025-03-03 22:03:28,543 INFO L226 Difference]: Without dead ends: 174 [2025-03-03 22:03:28,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:28,547 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 70 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:28,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 265 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:03:28,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-03 22:03:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 165. [2025-03-03 22:03:28,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 94 states have (on average 1.297872340425532) internal successors, (122), 94 states have internal predecessors, (122), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 22:03:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2025-03-03 22:03:28,575 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 215 [2025-03-03 22:03:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:28,575 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2025-03-03 22:03:28,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2025-03-03 22:03:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 22:03:28,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:28,580 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:28,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:03:28,580 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1535602825, now seen corresponding path program 1 times [2025-03-03 22:03:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622969314] [2025-03-03 22:03:28,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:28,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 22:03:28,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 22:03:28,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:28,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 22:03:28,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622969314] [2025-03-03 22:03:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622969314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:28,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:03:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:03:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30711729] [2025-03-03 22:03:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:03:28,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:28,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:03:28,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:28,872 INFO L87 Difference]: Start difference. First operand 165 states and 258 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:28,940 INFO L93 Difference]: Finished difference Result 354 states and 558 transitions. [2025-03-03 22:03:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:03:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-03 22:03:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:28,945 INFO L225 Difference]: With dead ends: 354 [2025-03-03 22:03:28,947 INFO L226 Difference]: Without dead ends: 255 [2025-03-03 22:03:28,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:28,948 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 84 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:28,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 287 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:03:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-03 22:03:28,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2025-03-03 22:03:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 147 states have (on average 1.3129251700680271) internal successors, (193), 147 states have internal predecessors, (193), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 22:03:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 397 transitions. [2025-03-03 22:03:28,995 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 397 transitions. Word has length 216 [2025-03-03 22:03:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:28,997 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 397 transitions. [2025-03-03 22:03:28,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:28,998 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 397 transitions. [2025-03-03 22:03:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 22:03:29,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:29,002 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:03:29,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash -819455660, now seen corresponding path program 1 times [2025-03-03 22:03:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:29,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141029310] [2025-03-03 22:03:29,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:29,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 22:03:29,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 22:03:29,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:29,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 22:03:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141029310] [2025-03-03 22:03:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141029310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:03:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:03:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485315140] [2025-03-03 22:03:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:29,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:03:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:29,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:03:29,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:29,261 INFO L87 Difference]: Start difference. First operand 253 states and 397 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:29,320 INFO L93 Difference]: Finished difference Result 443 states and 698 transitions. [2025-03-03 22:03:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:03:29,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 22:03:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:29,324 INFO L225 Difference]: With dead ends: 443 [2025-03-03 22:03:29,325 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 22:03:29,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:29,326 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:29,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 273 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:03:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 22:03:29,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2025-03-03 22:03:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 147 states have (on average 1.2993197278911566) internal successors, (191), 147 states have internal predecessors, (191), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 22:03:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 395 transitions. [2025-03-03 22:03:29,375 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 395 transitions. Word has length 218 [2025-03-03 22:03:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:29,376 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 395 transitions. [2025-03-03 22:03:29,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2025-03-03 22:03:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 22:03:29,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:29,379 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:29,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:03:29,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:29,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:29,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1749288924, now seen corresponding path program 1 times [2025-03-03 22:03:29,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:29,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108389536] [2025-03-03 22:03:29,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:29,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:29,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 22:03:29,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 22:03:29,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:29,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:29,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 22:03:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108389536] [2025-03-03 22:03:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108389536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:03:29,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 22:03:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893383469] [2025-03-03 22:03:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 22:03:29,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:29,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 22:03:29,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:29,635 INFO L87 Difference]: Start difference. First operand 253 states and 395 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:29,694 INFO L93 Difference]: Finished difference Result 609 states and 959 transitions. [2025-03-03 22:03:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 22:03:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 22:03:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:29,699 INFO L225 Difference]: With dead ends: 609 [2025-03-03 22:03:29,699 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 22:03:29,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 22:03:29,701 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 74 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:29,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 304 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:03:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 22:03:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2025-03-03 22:03:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 253 states have (on average 1.308300395256917) internal successors, (331), 253 states have internal predecessors, (331), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-03 22:03:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 671 transitions. [2025-03-03 22:03:29,754 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 671 transitions. Word has length 219 [2025-03-03 22:03:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:29,757 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 671 transitions. [2025-03-03 22:03:29,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:29,757 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 671 transitions. [2025-03-03 22:03:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 22:03:29,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:29,759 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:29,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 22:03:29,759 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:29,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:29,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1148871814, now seen corresponding path program 1 times [2025-03-03 22:03:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:29,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479780160] [2025-03-03 22:03:29,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:29,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 22:03:29,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 22:03:29,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:29,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:03:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 22:03:30,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:03:30,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479780160] [2025-03-03 22:03:30,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479780160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:03:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:03:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 22:03:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500978569] [2025-03-03 22:03:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:03:30,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 22:03:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:03:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 22:03:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:03:30,392 INFO L87 Difference]: Start difference. First operand 429 states and 671 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:03:30,513 INFO L93 Difference]: Finished difference Result 597 states and 915 transitions. [2025-03-03 22:03:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 22:03:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-03 22:03:30,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:03:30,517 INFO L225 Difference]: With dead ends: 597 [2025-03-03 22:03:30,519 INFO L226 Difference]: Without dead ends: 507 [2025-03-03 22:03:30,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 22:03:30,520 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 71 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 22:03:30,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 439 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 22:03:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-03 22:03:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 485. [2025-03-03 22:03:30,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 297 states have (on average 1.303030303030303) internal successors, (387), 299 states have internal predecessors, (387), 178 states have call successors, (178), 9 states have call predecessors, (178), 9 states have return successors, (178), 176 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-03 22:03:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 743 transitions. [2025-03-03 22:03:30,573 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 743 transitions. Word has length 220 [2025-03-03 22:03:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:03:30,574 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 743 transitions. [2025-03-03 22:03:30,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 22:03:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 743 transitions. [2025-03-03 22:03:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 22:03:30,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:03:30,576 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:03:30,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:03:30,576 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:03:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:03:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 593938521, now seen corresponding path program 1 times [2025-03-03 22:03:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:03:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159587933] [2025-03-03 22:03:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:03:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:03:30,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 22:03:30,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 22:03:30,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:03:30,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat