./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.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 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:05:55,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:05:55,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:05:55,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:05:55,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:05:55,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:05:55,128 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:05:55,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:05:55,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:05:55,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:05:55,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:05:55,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:05:55,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:05:55,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:05:55,131 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:05:55,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:05:55,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:05:55,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:05:55,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:05:55,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:55,133 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:05:55,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:05:55,133 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 -> 5de4c46c7cdadd96e091f691a19e362de9991e387636643426a8b01f7f6942d0 [2025-03-03 20:05:55,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:05:55,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:05:55,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:05:55,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:05:55,385 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:05:55,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-03-03 20:05:56,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67220f59a/87b2478ee4614d90a88a04a8c5bb4f17/FLAGc002fc98d [2025-03-03 20:05:56,850 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:05:56,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-03-03 20:05:56,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67220f59a/87b2478ee4614d90a88a04a8c5bb4f17/FLAGc002fc98d [2025-03-03 20:05:57,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67220f59a/87b2478ee4614d90a88a04a8c5bb4f17 [2025-03-03 20:05:57,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:05:57,100 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:05:57,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:57,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:05:57,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:05:57,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa33da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57, skipping insertion in model container [2025-03-03 20:05:57,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:05:57,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-03-03 20:05:57,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:57,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:05:57,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-19.i[916,929] [2025-03-03 20:05:57,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:05:57,550 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:05:57,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57 WrapperNode [2025-03-03 20:05:57,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:05:57,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:57,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:05:57,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:05:57,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,656 INFO L138 Inliner]: procedures = 26, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 740 [2025-03-03 20:05:57,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:05:57,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:05:57,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:05:57,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:05:57,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:05:57,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,751 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:05:57,787 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:05:57,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:05:57,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:05:57,788 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (1/1) ... [2025-03-03 20:05:57,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:05:57,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:57,813 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:05:57,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:05:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:05:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:05:57,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:05:57,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:05:57,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:05:57,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:05:57,960 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:05:57,961 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:05:58,919 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 20:05:58,920 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:05:58,949 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:05:58,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:05:58,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:58 BoogieIcfgContainer [2025-03-03 20:05:58,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:05:58,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:05:58,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:05:58,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:05:58,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:05:57" (1/3) ... [2025-03-03 20:05:58,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b55d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:58, skipping insertion in model container [2025-03-03 20:05:58,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:05:57" (2/3) ... [2025-03-03 20:05:58,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b55d99c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:05:58, skipping insertion in model container [2025-03-03 20:05:58,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:05:58" (3/3) ... [2025-03-03 20:05:58,958 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i [2025-03-03 20:05:58,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:05:58,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-19.i that has 2 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:05:59,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:05:59,041 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;@7ee9b709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:05:59,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:05:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 20:05:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 20:05:59,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:05:59,074 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:05:59,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:05:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:05:59,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2115927175, now seen corresponding path program 1 times [2025-03-03 20:05:59,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:05:59,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541409863] [2025-03-03 20:05:59,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:59,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:05:59,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:05:59,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:05:59,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:59,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-03-03 20:05:59,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:05:59,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541409863] [2025-03-03 20:05:59,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541409863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:05:59,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306204988] [2025-03-03 20:05:59,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:05:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:05:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:05:59,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:05:59,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:05:59,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:05:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:05:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:05:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:05:59,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:05:59,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:06:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-03-03 20:06:00,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:06:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306204988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:00,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:06:00,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:06:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245687799] [2025-03-03 20:06:00,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:00,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:06:00,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:00,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:06:00,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:06:00,031 INFO L87 Difference]: Start difference. First operand has 302 states, 209 states have (on average 1.61244019138756) internal successors, (337), 210 states have internal predecessors, (337), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-03-03 20:06:00,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:00,088 INFO L93 Difference]: Finished difference Result 593 states and 1109 transitions. [2025-03-03 20:06:00,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:06:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) Word has length 594 [2025-03-03 20:06:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:00,096 INFO L225 Difference]: With dead ends: 593 [2025-03-03 20:06:00,096 INFO L226 Difference]: Without dead ends: 294 [2025-03-03 20:06:00,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:06:00,105 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:00,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 486 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-03 20:06:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2025-03-03 20:06:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 202 states have (on average 1.5742574257425743) internal successors, (318), 202 states have internal predecessors, (318), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 20:06:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2025-03-03 20:06:00,176 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 594 [2025-03-03 20:06:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:00,177 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2025-03-03 20:06:00,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.5) internal successors, (149), 2 states have internal predecessors, (149), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-03-03 20:06:00,178 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2025-03-03 20:06:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 20:06:00,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:00,188 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:00,197 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-03 20:06:00,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:06:00,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:00,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:00,394 INFO L85 PathProgramCache]: Analyzing trace with hash 401235624, now seen corresponding path program 1 times [2025-03-03 20:06:00,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:00,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633665347] [2025-03-03 20:06:00,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:00,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:00,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:06:00,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:06:00,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:00,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633665347] [2025-03-03 20:06:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633665347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:01,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:01,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829780685] [2025-03-03 20:06:01,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:01,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:01,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:01,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:01,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:01,033 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:01,127 INFO L93 Difference]: Finished difference Result 780 states and 1320 transitions. [2025-03-03 20:06:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-03-03 20:06:01,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:01,136 INFO L225 Difference]: With dead ends: 780 [2025-03-03 20:06:01,138 INFO L226 Difference]: Without dead ends: 489 [2025-03-03 20:06:01,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:01,140 INFO L435 NwaCegarLoop]: 635 mSDtfsCounter, 291 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:01,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 1110 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-03 20:06:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2025-03-03 20:06:01,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 337 states have (on average 1.5697329376854599) internal successors, (529), 338 states have internal predecessors, (529), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 20:06:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 821 transitions. [2025-03-03 20:06:01,204 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 821 transitions. Word has length 594 [2025-03-03 20:06:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 821 transitions. [2025-03-03 20:06:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 821 transitions. [2025-03-03 20:06:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 20:06:01,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:01,220 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:01,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:06:01,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:01,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:01,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1094337321, now seen corresponding path program 1 times [2025-03-03 20:06:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:01,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909970851] [2025-03-03 20:06:01,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:01,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:06:01,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:06:01,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:01,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:01,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:01,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909970851] [2025-03-03 20:06:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909970851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:01,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:01,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066196870] [2025-03-03 20:06:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:01,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:01,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:01,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:01,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:01,546 INFO L87 Difference]: Start difference. First operand 486 states and 821 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:01,671 INFO L93 Difference]: Finished difference Result 1305 states and 2197 transitions. [2025-03-03 20:06:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:01,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-03-03 20:06:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:01,683 INFO L225 Difference]: With dead ends: 1305 [2025-03-03 20:06:01,685 INFO L226 Difference]: Without dead ends: 822 [2025-03-03 20:06:01,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:01,688 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 265 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:01,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 1139 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-03-03 20:06:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 819. [2025-03-03 20:06:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 554 states have (on average 1.536101083032491) internal successors, (851), 557 states have internal predecessors, (851), 260 states have call successors, (260), 4 states have call predecessors, (260), 4 states have return successors, (260), 257 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-03 20:06:01,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1371 transitions. [2025-03-03 20:06:01,768 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1371 transitions. Word has length 594 [2025-03-03 20:06:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:01,769 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1371 transitions. [2025-03-03 20:06:01,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1371 transitions. [2025-03-03 20:06:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 20:06:01,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:01,776 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:01,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:06:01,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:01,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:01,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1274038985, now seen corresponding path program 1 times [2025-03-03 20:06:01,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:01,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284913536] [2025-03-03 20:06:01,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:01,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:01,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:06:01,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:06:01,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:01,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:02,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284913536] [2025-03-03 20:06:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284913536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142204224] [2025-03-03 20:06:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:02,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:02,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:02,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:02,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:02,588 INFO L87 Difference]: Start difference. First operand 819 states and 1371 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:03,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:03,459 INFO L93 Difference]: Finished difference Result 3377 states and 5598 transitions. [2025-03-03 20:06:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:06:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-03-03 20:06:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:03,479 INFO L225 Difference]: With dead ends: 3377 [2025-03-03 20:06:03,480 INFO L226 Difference]: Without dead ends: 2561 [2025-03-03 20:06:03,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:03,484 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 867 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:03,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1670 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:06:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2025-03-03 20:06:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1655. [2025-03-03 20:06:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1170 states have (on average 1.5683760683760684) internal successors, (1835), 1177 states have internal predecessors, (1835), 476 states have call successors, (476), 8 states have call predecessors, (476), 8 states have return successors, (476), 469 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-03 20:06:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2787 transitions. [2025-03-03 20:06:03,678 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2787 transitions. Word has length 594 [2025-03-03 20:06:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:03,679 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2787 transitions. [2025-03-03 20:06:03,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2787 transitions. [2025-03-03 20:06:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-03 20:06:03,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:03,686 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:03,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:06:03,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:03,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:03,687 INFO L85 PathProgramCache]: Analyzing trace with hash 429567114, now seen corresponding path program 1 times [2025-03-03 20:06:03,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:03,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789929082] [2025-03-03 20:06:03,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:03,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:03,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-03 20:06:03,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-03 20:06:03,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:03,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:03,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:03,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789929082] [2025-03-03 20:06:03,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789929082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:03,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:03,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:03,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029812187] [2025-03-03 20:06:03,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:03,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:03,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:03,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:03,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:03,985 INFO L87 Difference]: Start difference. First operand 1655 states and 2787 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:04,198 INFO L93 Difference]: Finished difference Result 4959 states and 8355 transitions. [2025-03-03 20:06:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 594 [2025-03-03 20:06:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:04,221 INFO L225 Difference]: With dead ends: 4959 [2025-03-03 20:06:04,222 INFO L226 Difference]: Without dead ends: 3307 [2025-03-03 20:06:04,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:04,229 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 317 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:04,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:06:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-03-03 20:06:04,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3305. [2025-03-03 20:06:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 2336 states have (on average 1.5684931506849316) internal successors, (3664), 2350 states have internal predecessors, (3664), 952 states have call successors, (952), 16 states have call predecessors, (952), 16 states have return successors, (952), 938 states have call predecessors, (952), 952 states have call successors, (952) [2025-03-03 20:06:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 5568 transitions. [2025-03-03 20:06:04,483 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 5568 transitions. Word has length 594 [2025-03-03 20:06:04,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:04,487 INFO L471 AbstractCegarLoop]: Abstraction has 3305 states and 5568 transitions. [2025-03-03 20:06:04,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 5568 transitions. [2025-03-03 20:06:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-03-03 20:06:04,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:04,494 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:04,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:06:04,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:04,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:04,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1888398096, now seen corresponding path program 1 times [2025-03-03 20:06:04,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336899433] [2025-03-03 20:06:04,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-03-03 20:06:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-03-03 20:06:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:04,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:05,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336899433] [2025-03-03 20:06:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336899433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:05,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490212420] [2025-03-03 20:06:05,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:05,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:05,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:05,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:05,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:05,020 INFO L87 Difference]: Start difference. First operand 3305 states and 5568 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:05,292 INFO L93 Difference]: Finished difference Result 8470 states and 14245 transitions. [2025-03-03 20:06:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:05,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 595 [2025-03-03 20:06:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:05,327 INFO L225 Difference]: With dead ends: 8470 [2025-03-03 20:06:05,328 INFO L226 Difference]: Without dead ends: 5168 [2025-03-03 20:06:05,340 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 20:06:05,342 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 289 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:05,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1015 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:06:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2025-03-03 20:06:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5158. [2025-03-03 20:06:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5158 states, 3608 states have (on average 1.5518292682926829) internal successors, (5599), 3629 states have internal predecessors, (5599), 1520 states have call successors, (1520), 29 states have call predecessors, (1520), 29 states have return successors, (1520), 1499 states have call predecessors, (1520), 1520 states have call successors, (1520) [2025-03-03 20:06:05,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 8639 transitions. [2025-03-03 20:06:05,812 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 8639 transitions. Word has length 595 [2025-03-03 20:06:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 5158 states and 8639 transitions. [2025-03-03 20:06:05,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:05,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 8639 transitions. [2025-03-03 20:06:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-03 20:06:05,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:05,820 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:05,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:06:05,821 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1779058930, now seen corresponding path program 1 times [2025-03-03 20:06:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750980434] [2025-03-03 20:06:05,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:05,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-03 20:06:05,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-03 20:06:05,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:05,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:06,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750980434] [2025-03-03 20:06:06,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750980434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:06,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:06:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265050480] [2025-03-03 20:06:06,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:06,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:06:06,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:06,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:06:06,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:06,909 INFO L87 Difference]: Start difference. First operand 5158 states and 8639 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:08,143 INFO L93 Difference]: Finished difference Result 14298 states and 23991 transitions. [2025-03-03 20:06:08,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:06:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 596 [2025-03-03 20:06:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:08,198 INFO L225 Difference]: With dead ends: 14298 [2025-03-03 20:06:08,198 INFO L226 Difference]: Without dead ends: 9238 [2025-03-03 20:06:08,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:06:08,215 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 328 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:08,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 942 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:06:08,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9238 states. [2025-03-03 20:06:09,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9238 to 9212. [2025-03-03 20:06:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9212 states, 6798 states have (on average 1.582230067666961) internal successors, (10756), 6843 states have internal predecessors, (10756), 2360 states have call successors, (2360), 53 states have call predecessors, (2360), 53 states have return successors, (2360), 2315 states have call predecessors, (2360), 2360 states have call successors, (2360) [2025-03-03 20:06:09,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9212 states to 9212 states and 15476 transitions. [2025-03-03 20:06:09,121 INFO L78 Accepts]: Start accepts. Automaton has 9212 states and 15476 transitions. Word has length 596 [2025-03-03 20:06:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 9212 states and 15476 transitions. [2025-03-03 20:06:09,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 9212 states and 15476 transitions. [2025-03-03 20:06:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-03 20:06:09,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:09,138 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:09,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:06:09,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:09,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 406875117, now seen corresponding path program 1 times [2025-03-03 20:06:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:09,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210789702] [2025-03-03 20:06:09,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:09,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-03 20:06:09,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-03 20:06:09,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:09,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:10,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210789702] [2025-03-03 20:06:10,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210789702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:10,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:06:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300686524] [2025-03-03 20:06:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:10,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:06:10,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:10,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:06:10,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:06:10,783 INFO L87 Difference]: Start difference. First operand 9212 states and 15476 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:16,082 INFO L93 Difference]: Finished difference Result 52422 states and 88048 transitions. [2025-03-03 20:06:16,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:06:16,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 596 [2025-03-03 20:06:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:16,247 INFO L225 Difference]: With dead ends: 52422 [2025-03-03 20:06:16,248 INFO L226 Difference]: Without dead ends: 43308 [2025-03-03 20:06:16,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:06:16,287 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 2698 mSDsluCounter, 3288 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2698 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 514 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:16,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2698 Valid, 4216 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [514 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:06:16,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43308 states. [2025-03-03 20:06:20,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43308 to 43246. [2025-03-03 20:06:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43246 states, 32376 states have (on average 1.5841363973313565) internal successors, (51288), 32605 states have internal predecessors, (51288), 10616 states have call successors, (10616), 253 states have call predecessors, (10616), 253 states have return successors, (10616), 10387 states have call predecessors, (10616), 10616 states have call successors, (10616) [2025-03-03 20:06:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43246 states to 43246 states and 72520 transitions. [2025-03-03 20:06:21,041 INFO L78 Accepts]: Start accepts. Automaton has 43246 states and 72520 transitions. Word has length 596 [2025-03-03 20:06:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:21,042 INFO L471 AbstractCegarLoop]: Abstraction has 43246 states and 72520 transitions. [2025-03-03 20:06:21,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 43246 states and 72520 transitions. [2025-03-03 20:06:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-03 20:06:21,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:21,065 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:21,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:06:21,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:21,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1849902650, now seen corresponding path program 1 times [2025-03-03 20:06:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:21,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812776466] [2025-03-03 20:06:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:21,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-03 20:06:21,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-03 20:06:21,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:21,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812776466] [2025-03-03 20:06:21,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812776466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:21,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:21,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:06:21,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347779709] [2025-03-03 20:06:21,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:21,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:06:21,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:21,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:06:21,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:06:21,819 INFO L87 Difference]: Start difference. First operand 43246 states and 72520 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:06:29,688 INFO L93 Difference]: Finished difference Result 120446 states and 201994 transitions. [2025-03-03 20:06:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:06:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 597 [2025-03-03 20:06:29,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:06:29,998 INFO L225 Difference]: With dead ends: 120446 [2025-03-03 20:06:29,999 INFO L226 Difference]: Without dead ends: 77298 [2025-03-03 20:06:30,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:06:30,109 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 1331 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:06:30,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 2623 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:06:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77298 states. [2025-03-03 20:06:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77298 to 40288. [2025-03-03 20:06:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40288 states, 30190 states have (on average 1.583504471679364) internal successors, (47806), 30404 states have internal predecessors, (47806), 9860 states have call successors, (9860), 237 states have call predecessors, (9860), 237 states have return successors, (9860), 9646 states have call predecessors, (9860), 9860 states have call successors, (9860) [2025-03-03 20:06:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40288 states to 40288 states and 67526 transitions. [2025-03-03 20:06:35,584 INFO L78 Accepts]: Start accepts. Automaton has 40288 states and 67526 transitions. Word has length 597 [2025-03-03 20:06:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:06:35,585 INFO L471 AbstractCegarLoop]: Abstraction has 40288 states and 67526 transitions. [2025-03-03 20:06:35,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-03-03 20:06:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40288 states and 67526 transitions. [2025-03-03 20:06:35,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 20:06:35,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:06:35,610 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:06:35,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:06:35,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:06:35,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:06:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash -908861274, now seen corresponding path program 1 times [2025-03-03 20:06:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:06:35,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099247962] [2025-03-03 20:06:35,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:06:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:06:35,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:06:35,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:06:35,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:06:35,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:06:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-03-03 20:06:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:06:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099247962] [2025-03-03 20:06:38,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099247962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:06:38,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:06:38,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 20:06:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232082111] [2025-03-03 20:06:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:06:38,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 20:06:38,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:06:38,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 20:06:38,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:06:38,883 INFO L87 Difference]: Start difference. First operand 40288 states and 67526 transitions. Second operand has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) [2025-03-03 20:07:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:07:04,441 INFO L93 Difference]: Finished difference Result 234394 states and 393762 transitions. [2025-03-03 20:07:04,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 20:07:04,442 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) Word has length 598 [2025-03-03 20:07:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:07:05,261 INFO L225 Difference]: With dead ends: 234394 [2025-03-03 20:07:05,261 INFO L226 Difference]: Without dead ends: 200352 [2025-03-03 20:07:05,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=333, Invalid=789, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 20:07:05,356 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 6623 mSDsluCounter, 5371 mSDsCounter, 0 mSdLazyCounter, 4555 mSolverCounterSat, 2025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6623 SdHoareTripleChecker+Valid, 6294 SdHoareTripleChecker+Invalid, 6580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2025 IncrementalHoareTripleChecker+Valid, 4555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:07:05,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6623 Valid, 6294 Invalid, 6580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2025 Valid, 4555 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-03 20:07:05,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200352 states. [2025-03-03 20:07:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200352 to 61588. [2025-03-03 20:07:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61588 states, 46940 states have (on average 1.586259054111632) internal successors, (74459), 47246 states have internal predecessors, (74459), 13988 states have call successors, (13988), 659 states have call predecessors, (13988), 659 states have return successors, (13988), 13682 states have call predecessors, (13988), 13988 states have call successors, (13988) [2025-03-03 20:07:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61588 states to 61588 states and 102435 transitions. [2025-03-03 20:07:14,864 INFO L78 Accepts]: Start accepts. Automaton has 61588 states and 102435 transitions. Word has length 598 [2025-03-03 20:07:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:07:14,865 INFO L471 AbstractCegarLoop]: Abstraction has 61588 states and 102435 transitions. [2025-03-03 20:07:14,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.4375) internal successors, (151), 16 states have internal predecessors, (151), 3 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 3 states have call predecessors, (90), 3 states have call successors, (90) [2025-03-03 20:07:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 61588 states and 102435 transitions. [2025-03-03 20:07:14,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-03-03 20:07:14,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:07:14,888 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:07:14,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:07:14,888 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:07:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:07:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 224329319, now seen corresponding path program 1 times [2025-03-03 20:07:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:07:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626067469] [2025-03-03 20:07:14,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:07:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:07:14,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-03-03 20:07:15,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-03-03 20:07:15,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:07:15,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat