./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.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_operatoramount_amount250_file-58.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 282ae36df5695e27b909a2bf93e33671def0076fbd602d7ca03e88eb2683530d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:13:12,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:13:12,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:13:12,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:13:12,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:13:12,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:13:12,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:13:12,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:13:12,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:13:12,215 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:13:12,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:13:12,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:13:12,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:13:12,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:13:12,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:13:12,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:12,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:13:12,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:13:12,218 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 -> 282ae36df5695e27b909a2bf93e33671def0076fbd602d7ca03e88eb2683530d [2025-03-04 00:13:12,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:13:12,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:13:12,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:13:12,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:13:12,438 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:13:12,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i [2025-03-04 00:13:13,550 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e6c1d59/f1140fb48acb4ceeac688d18ee093cd5/FLAGf5c647387 [2025-03-04 00:13:13,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:13:13,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-58.i [2025-03-04 00:13:13,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e6c1d59/f1140fb48acb4ceeac688d18ee093cd5/FLAGf5c647387 [2025-03-04 00:13:14,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1e6c1d59/f1140fb48acb4ceeac688d18ee093cd5 [2025-03-04 00:13:14,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:13:14,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:13:14,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:14,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:13:14,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:13:14,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14, skipping insertion in model container [2025-03-04 00:13:14,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:13:14,253 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_operatoramount_amount250_file-58.i[916,929] [2025-03-04 00:13:14,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:14,421 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:13:14,429 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_operatoramount_amount250_file-58.i[916,929] [2025-03-04 00:13:14,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:13:14,528 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:13:14,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14 WrapperNode [2025-03-04 00:13:14,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:13:14,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:14,530 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:13:14,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:13:14,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,604 INFO L138 Inliner]: procedures = 26, calls = 77, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 449 [2025-03-04 00:13:14,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:13:14,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:13:14,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:13:14,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:13:14,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,630 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,672 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-04 00:13:14,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,694 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:13:14,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:13:14,719 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:13:14,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:13:14,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (1/1) ... [2025-03-04 00:13:14,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:13:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:14,745 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-04 00:13:14,748 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-04 00:13:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:13:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:13:14,764 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:13:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:13:14,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:13:14,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:13:14,883 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:13:14,884 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:13:15,474 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1; [2025-03-04 00:13:15,575 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2025-03-04 00:13:15,576 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:13:15,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:13:15,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:13:15,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:15 BoogieIcfgContainer [2025-03-04 00:13:15,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:13:15,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:13:15,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:13:15,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:13:15,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:13:14" (1/3) ... [2025-03-04 00:13:15,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f33d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:15, skipping insertion in model container [2025-03-04 00:13:15,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:13:14" (2/3) ... [2025-03-04 00:13:15,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c8f33d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:13:15, skipping insertion in model container [2025-03-04 00:13:15,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:13:15" (3/3) ... [2025-03-04 00:13:15,610 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-58.i [2025-03-04 00:13:15,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:13:15,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-58.i that has 2 procedures, 187 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:13:15,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:13:15,682 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;@79a7614a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:13:15,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:13:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 00:13:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-04 00:13:15,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:15,704 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:15,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:15,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:15,710 INFO L85 PathProgramCache]: Analyzing trace with hash 625853053, now seen corresponding path program 1 times [2025-03-04 00:13:15,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:15,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345806025] [2025-03-04 00:13:15,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:15,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:15,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-04 00:13:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-04 00:13:15,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:15,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-04 00:13:16,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:16,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345806025] [2025-03-04 00:13:16,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345806025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:16,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998919037] [2025-03-04 00:13:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:16,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:16,177 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-04 00:13:16,179 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-04 00:13:16,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-04 00:13:16,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-04 00:13:16,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:16,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:16,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:13:16,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 7938 trivial. 0 not checked. [2025-03-04 00:13:16,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:13:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998919037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:16,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:13:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:13:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058893261] [2025-03-04 00:13:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:16,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:13:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:16,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:13:16,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:13:16,519 INFO L87 Difference]: Start difference. First operand has 187 states, 120 states have (on average 1.4583333333333333) internal successors, (175), 121 states have internal predecessors, (175), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:13:16,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:16,555 INFO L93 Difference]: Finished difference Result 368 states and 665 transitions. [2025-03-04 00:13:16,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:13:16,557 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) Word has length 402 [2025-03-04 00:13:16,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:16,563 INFO L225 Difference]: With dead ends: 368 [2025-03-04 00:13:16,565 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 00:13:16,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 403 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-04 00:13:16,571 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:16,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:13:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 00:13:16,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-03-04 00:13:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 00:13:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 298 transitions. [2025-03-04 00:13:16,636 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 298 transitions. Word has length 402 [2025-03-04 00:13:16,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:16,637 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 298 transitions. [2025-03-04 00:13:16,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (64), 2 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 2 states have call successors, (64) [2025-03-04 00:13:16,638 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 298 transitions. [2025-03-04 00:13:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-04 00:13:16,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:16,645 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:16,654 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-04 00:13:16,850 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-04 00:13:16,850 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 392710119, now seen corresponding path program 1 times [2025-03-04 00:13:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888608427] [2025-03-04 00:13:16,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:16,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-04 00:13:16,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-04 00:13:16,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:16,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:17,259 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888608427] [2025-03-04 00:13:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888608427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:13:17,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479661800] [2025-03-04 00:13:17,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:17,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:13:17,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:17,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:13:17,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:17,265 INFO L87 Difference]: Start difference. First operand 184 states and 298 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:17,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:17,372 INFO L93 Difference]: Finished difference Result 425 states and 689 transitions. [2025-03-04 00:13:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:13:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 402 [2025-03-04 00:13:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:17,376 INFO L225 Difference]: With dead ends: 425 [2025-03-04 00:13:17,378 INFO L226 Difference]: Without dead ends: 244 [2025-03-04 00:13:17,381 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-04 00:13:17,382 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 102 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:17,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 546 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:13:17,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-03-04 00:13:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 197. [2025-03-04 00:13:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 131 states have (on average 1.450381679389313) internal successors, (190), 131 states have internal predecessors, (190), 64 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 00:13:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 318 transitions. [2025-03-04 00:13:17,414 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 318 transitions. Word has length 402 [2025-03-04 00:13:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 318 transitions. [2025-03-04 00:13:17,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 318 transitions. [2025-03-04 00:13:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-03-04 00:13:17,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:17,425 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:17,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:13:17,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:17,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:17,426 INFO L85 PathProgramCache]: Analyzing trace with hash -788768501, now seen corresponding path program 1 times [2025-03-04 00:13:17,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:17,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948736035] [2025-03-04 00:13:17,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:17,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:17,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-03-04 00:13:17,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-03-04 00:13:17,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:17,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948736035] [2025-03-04 00:13:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948736035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:17,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:17,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:13:17,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580006385] [2025-03-04 00:13:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:17,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:13:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:17,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:13:17,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:13:17,777 INFO L87 Difference]: Start difference. First operand 197 states and 318 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:17,879 INFO L93 Difference]: Finished difference Result 582 states and 942 transitions. [2025-03-04 00:13:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:13:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 402 [2025-03-04 00:13:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:17,886 INFO L225 Difference]: With dead ends: 582 [2025-03-04 00:13:17,886 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 00:13:17,887 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-04 00:13:17,889 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 279 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:17,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 581 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:13:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 00:13:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2025-03-04 00:13:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 255 states have (on average 1.4352941176470588) internal successors, (366), 255 states have internal predecessors, (366), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 00:13:17,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 622 transitions. [2025-03-04 00:13:17,947 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 622 transitions. Word has length 402 [2025-03-04 00:13:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:17,950 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 622 transitions. [2025-03-04 00:13:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 622 transitions. [2025-03-04 00:13:17,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-03-04 00:13:17,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:17,957 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:17,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:13:17,957 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:17,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:17,958 INFO L85 PathProgramCache]: Analyzing trace with hash 997192620, now seen corresponding path program 1 times [2025-03-04 00:13:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087323216] [2025-03-04 00:13:17,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:17,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-03-04 00:13:18,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-03-04 00:13:18,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:18,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087323216] [2025-03-04 00:13:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087323216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:18,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:18,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:13:18,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821224653] [2025-03-04 00:13:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:18,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:13:18,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:18,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:13:18,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:13:18,748 INFO L87 Difference]: Start difference. First operand 386 states and 622 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:19,123 INFO L93 Difference]: Finished difference Result 1020 states and 1631 transitions. [2025-03-04 00:13:19,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:13:19,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 403 [2025-03-04 00:13:19,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:19,130 INFO L225 Difference]: With dead ends: 1020 [2025-03-04 00:13:19,130 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 00:13:19,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:19,134 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 248 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:19,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 863 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:13:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 00:13:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 558. [2025-03-04 00:13:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 362 states have (on average 1.4005524861878453) internal successors, (507), 362 states have internal predecessors, (507), 192 states have call successors, (192), 3 states have call predecessors, (192), 3 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-04 00:13:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 891 transitions. [2025-03-04 00:13:19,193 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 891 transitions. Word has length 403 [2025-03-04 00:13:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:19,196 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 891 transitions. [2025-03-04 00:13:19,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 891 transitions. [2025-03-04 00:13:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:13:19,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:19,201 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:19,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:13:19,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash 480042642, now seen corresponding path program 1 times [2025-03-04 00:13:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305592589] [2025-03-04 00:13:19,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:19,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:19,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:19,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:19,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:19,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305592589] [2025-03-04 00:13:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305592589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:20,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:20,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:13:20,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546731404] [2025-03-04 00:13:20,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:20,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:13:20,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:20,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:13:20,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:13:20,103 INFO L87 Difference]: Start difference. First operand 558 states and 891 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:20,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:20,656 INFO L93 Difference]: Finished difference Result 1363 states and 2162 transitions. [2025-03-04 00:13:20,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:13:20,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-03-04 00:13:20,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:20,663 INFO L225 Difference]: With dead ends: 1363 [2025-03-04 00:13:20,663 INFO L226 Difference]: Without dead ends: 808 [2025-03-04 00:13:20,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:13:20,666 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 148 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:20,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 948 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:13:20,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-04 00:13:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 685. [2025-03-04 00:13:20,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 424 states have (on average 1.3679245283018868) internal successors, (580), 424 states have internal predecessors, (580), 256 states have call successors, (256), 4 states have call predecessors, (256), 4 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:13:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1092 transitions. [2025-03-04 00:13:20,760 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1092 transitions. Word has length 406 [2025-03-04 00:13:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:20,761 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 1092 transitions. [2025-03-04 00:13:20,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:20,762 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1092 transitions. [2025-03-04 00:13:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:13:20,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:20,765 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:20,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:13:20,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:20,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1530061199, now seen corresponding path program 1 times [2025-03-04 00:13:20,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:20,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33773017] [2025-03-04 00:13:20,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:20,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:21,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33773017] [2025-03-04 00:13:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33773017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:13:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909914546] [2025-03-04 00:13:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:25,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:13:25,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:25,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:13:25,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:13:25,673 INFO L87 Difference]: Start difference. First operand 685 states and 1092 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:28,795 INFO L93 Difference]: Finished difference Result 1377 states and 2156 transitions. [2025-03-04 00:13:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:13:28,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 406 [2025-03-04 00:13:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:28,801 INFO L225 Difference]: With dead ends: 1377 [2025-03-04 00:13:28,802 INFO L226 Difference]: Without dead ends: 994 [2025-03-04 00:13:28,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:13:28,805 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 807 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:28,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 1292 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 00:13:28,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2025-03-04 00:13:28,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 751. [2025-03-04 00:13:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 488 states have (on average 1.389344262295082) internal successors, (678), 488 states have internal predecessors, (678), 256 states have call successors, (256), 6 states have call predecessors, (256), 6 states have return successors, (256), 256 states have call predecessors, (256), 256 states have call successors, (256) [2025-03-04 00:13:28,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1190 transitions. [2025-03-04 00:13:28,886 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1190 transitions. Word has length 406 [2025-03-04 00:13:28,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:28,886 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1190 transitions. [2025-03-04 00:13:28,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:28,887 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1190 transitions. [2025-03-04 00:13:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2025-03-04 00:13:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:28,892 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:28,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:13:28,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:28,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:28,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2035619824, now seen corresponding path program 1 times [2025-03-04 00:13:28,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:28,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647805581] [2025-03-04 00:13:28,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:28,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:28,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:29,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:29,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:13:29,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647805581] [2025-03-04 00:13:29,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647805581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:29,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057316910] [2025-03-04 00:13:29,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:29,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:29,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:29,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:29,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:13:29,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-03-04 00:13:29,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-03-04 00:13:29,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:29,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:29,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:13:29,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 555 proven. 183 refuted. 0 times theorem prover too weak. 7326 trivial. 0 not checked. [2025-03-04 00:13:31,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:13:31,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057316910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:31,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:31,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2025-03-04 00:13:31,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100778627] [2025-03-04 00:13:31,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:31,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:13:31,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:31,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:13:31,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:13:31,624 INFO L87 Difference]: Start difference. First operand 751 states and 1190 transitions. Second operand has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) [2025-03-04 00:13:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:33,493 INFO L93 Difference]: Finished difference Result 3575 states and 5675 transitions. [2025-03-04 00:13:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:13:33,493 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) Word has length 406 [2025-03-04 00:13:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:33,510 INFO L225 Difference]: With dead ends: 3575 [2025-03-04 00:13:33,510 INFO L226 Difference]: Without dead ends: 3014 [2025-03-04 00:13:33,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 808 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:13:33,514 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 1029 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:33,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 2655 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 00:13:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2025-03-04 00:13:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 1699. [2025-03-04 00:13:33,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1101 states have (on average 1.3905540417801998) internal successors, (1531), 1103 states have internal predecessors, (1531), 580 states have call successors, (580), 17 states have call predecessors, (580), 17 states have return successors, (580), 578 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-04 00:13:33,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2691 transitions. [2025-03-04 00:13:33,711 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2691 transitions. Word has length 406 [2025-03-04 00:13:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:33,711 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2691 transitions. [2025-03-04 00:13:33,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.5) internal successors, (174), 12 states have internal predecessors, (174), 4 states have call successors, (192), 3 states have call predecessors, (192), 6 states have return successors, (192), 4 states have call predecessors, (192), 4 states have call successors, (192) [2025-03-04 00:13:33,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2691 transitions. [2025-03-04 00:13:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-04 00:13:33,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:33,714 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:33,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:13:33,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 00:13:33,914 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:33,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:33,915 INFO L85 PathProgramCache]: Analyzing trace with hash 559589734, now seen corresponding path program 1 times [2025-03-04 00:13:33,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:33,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718711699] [2025-03-04 00:13:33,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:33,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:34,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:34,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:34,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8064 trivial. 0 not checked. [2025-03-04 00:13:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718711699] [2025-03-04 00:13:35,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718711699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:35,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:35,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:13:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366794033] [2025-03-04 00:13:35,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:35,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:13:35,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:35,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:13:35,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:13:35,657 INFO L87 Difference]: Start difference. First operand 1699 states and 2691 transitions. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:36,579 INFO L93 Difference]: Finished difference Result 3724 states and 5769 transitions. [2025-03-04 00:13:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 00:13:36,580 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) Word has length 407 [2025-03-04 00:13:36,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:36,595 INFO L225 Difference]: With dead ends: 3724 [2025-03-04 00:13:36,596 INFO L226 Difference]: Without dead ends: 2560 [2025-03-04 00:13:36,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:13:36,600 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 466 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:36,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1366 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:13:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2025-03-04 00:13:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 1740. [2025-03-04 00:13:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1142 states have (on average 1.394045534150613) internal successors, (1592), 1144 states have internal predecessors, (1592), 580 states have call successors, (580), 17 states have call predecessors, (580), 17 states have return successors, (580), 578 states have call predecessors, (580), 580 states have call successors, (580) [2025-03-04 00:13:36,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2752 transitions. [2025-03-04 00:13:36,773 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2752 transitions. Word has length 407 [2025-03-04 00:13:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:36,774 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2752 transitions. [2025-03-04 00:13:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 1 states have call successors, (64), 1 states have call predecessors, (64), 1 states have return successors, (64), 1 states have call predecessors, (64), 1 states have call successors, (64) [2025-03-04 00:13:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2752 transitions. [2025-03-04 00:13:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-04 00:13:36,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:36,779 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:36,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:13:36,779 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:36,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:36,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2067141543, now seen corresponding path program 1 times [2025-03-04 00:13:36,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:36,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383393416] [2025-03-04 00:13:36,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:36,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:36,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:37,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:37,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:37,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:13:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383393416] [2025-03-04 00:13:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383393416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180581351] [2025-03-04 00:13:37,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:37,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:37,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:37,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:37,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:13:37,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:37,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:37,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:37,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:37,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 00:13:37,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 555 proven. 183 refuted. 0 times theorem prover too weak. 7326 trivial. 0 not checked. [2025-03-04 00:13:37,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:38,338 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 6 proven. 183 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:13:38,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180581351] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:38,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:38,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-04 00:13:38,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080919137] [2025-03-04 00:13:38,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:38,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:13:38,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:38,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:13:38,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:13:38,340 INFO L87 Difference]: Start difference. First operand 1740 states and 2752 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-03-04 00:13:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:38,809 INFO L93 Difference]: Finished difference Result 2991 states and 4676 transitions. [2025-03-04 00:13:38,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:13:38,809 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) Word has length 407 [2025-03-04 00:13:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:38,818 INFO L225 Difference]: With dead ends: 2991 [2025-03-04 00:13:38,819 INFO L226 Difference]: Without dead ends: 1821 [2025-03-04 00:13:38,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 811 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:13:38,823 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 316 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:38,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 815 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:13:38,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2025-03-04 00:13:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1670. [2025-03-04 00:13:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1068 states have (on average 1.3773408239700375) internal successors, (1471), 1068 states have internal predecessors, (1471), 576 states have call successors, (576), 25 states have call predecessors, (576), 25 states have return successors, (576), 576 states have call predecessors, (576), 576 states have call successors, (576) [2025-03-04 00:13:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2623 transitions. [2025-03-04 00:13:38,966 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2623 transitions. Word has length 407 [2025-03-04 00:13:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:38,967 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2623 transitions. [2025-03-04 00:13:38,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 2 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (126), 2 states have call predecessors, (126), 2 states have call successors, (126) [2025-03-04 00:13:38,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2623 transitions. [2025-03-04 00:13:38,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-04 00:13:38,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:38,969 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:38,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:13:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:39,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 770940647, now seen corresponding path program 1 times [2025-03-04 00:13:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39274524] [2025-03-04 00:13:39,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:39,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:39,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:39,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:39,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:40,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 7875 trivial. 0 not checked. [2025-03-04 00:13:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39274524] [2025-03-04 00:13:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39274524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:13:40,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692746874] [2025-03-04 00:13:40,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:40,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:40,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:13:40,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:13:40,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:13:40,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:40,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:40,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:40,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:40,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 938 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 00:13:40,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:13:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 1788 proven. 30 refuted. 0 times theorem prover too weak. 6246 trivial. 0 not checked. [2025-03-04 00:13:41,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:13:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 342 proven. 33 refuted. 0 times theorem prover too weak. 7689 trivial. 0 not checked. [2025-03-04 00:13:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692746874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:13:41,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:13:41,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 29 [2025-03-04 00:13:41,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971489738] [2025-03-04 00:13:41,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:13:41,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 00:13:41,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:41,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 00:13:41,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2025-03-04 00:13:41,679 INFO L87 Difference]: Start difference. First operand 1670 states and 2623 transitions. Second operand has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) [2025-03-04 00:13:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:49,245 INFO L93 Difference]: Finished difference Result 6213 states and 9480 transitions. [2025-03-04 00:13:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-04 00:13:49,246 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) Word has length 407 [2025-03-04 00:13:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:49,264 INFO L225 Difference]: With dead ends: 6213 [2025-03-04 00:13:49,265 INFO L226 Difference]: Without dead ends: 4692 [2025-03-04 00:13:49,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 935 GetRequests, 808 SyntacticMatches, 1 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5833 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2426, Invalid=13830, Unknown=0, NotChecked=0, Total=16256 [2025-03-04 00:13:49,272 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 6220 mSDsluCounter, 5069 mSDsCounter, 0 mSdLazyCounter, 4663 mSolverCounterSat, 5120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6277 SdHoareTripleChecker+Valid, 5529 SdHoareTripleChecker+Invalid, 9783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5120 IncrementalHoareTripleChecker+Valid, 4663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:49,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6277 Valid, 5529 Invalid, 9783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5120 Valid, 4663 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-04 00:13:49,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2025-03-04 00:13:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 2238. [2025-03-04 00:13:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2238 states, 1434 states have (on average 1.3179916317991631) internal successors, (1890), 1441 states have internal predecessors, (1890), 750 states have call successors, (750), 53 states have call predecessors, (750), 53 states have return successors, (750), 743 states have call predecessors, (750), 750 states have call successors, (750) [2025-03-04 00:13:49,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2238 states to 2238 states and 3390 transitions. [2025-03-04 00:13:49,560 INFO L78 Accepts]: Start accepts. Automaton has 2238 states and 3390 transitions. Word has length 407 [2025-03-04 00:13:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:49,561 INFO L471 AbstractCegarLoop]: Abstraction has 2238 states and 3390 transitions. [2025-03-04 00:13:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.172413793103448) internal successors, (237), 29 states have internal predecessors, (237), 9 states have call successors, (192), 4 states have call predecessors, (192), 9 states have return successors, (192), 9 states have call predecessors, (192), 9 states have call successors, (192) [2025-03-04 00:13:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2238 states and 3390 transitions. [2025-03-04 00:13:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2025-03-04 00:13:49,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:49,564 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:49,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 00:13:49,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:49,765 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:49,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1688979567, now seen corresponding path program 1 times [2025-03-04 00:13:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465733462] [2025-03-04 00:13:49,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:49,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 407 statements into 1 equivalence classes. [2025-03-04 00:13:50,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 407 of 407 statements. [2025-03-04 00:13:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat