./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-30.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-30.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 5c84ffa026999f71e09cac66fed6cd3f222fabb9c5ef5739891a11a470040a3a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:27:38,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:27:38,461 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:27:38,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:27:38,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:27:38,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:27:38,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:27:38,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:27:38,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:27:38,485 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:27:38,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:27:38,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:27:38,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:27:38,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:27:38,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:27:38,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:27:38,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:27:38,488 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:27:38,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:27:38,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:27:38,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:27:38,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:27:38,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:27:38,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:27:38,490 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 -> 5c84ffa026999f71e09cac66fed6cd3f222fabb9c5ef5739891a11a470040a3a [2025-03-17 04:27:38,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:27:38,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:27:38,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:27:38,758 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:27:38,758 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:27:38,760 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-30.i [2025-03-17 04:27:39,921 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215552a17/92c5b5ea54824d70aa737229efe516e0/FLAG95e0cdbcf [2025-03-17 04:27:40,211 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:27:40,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-30.i [2025-03-17 04:27:40,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215552a17/92c5b5ea54824d70aa737229efe516e0/FLAG95e0cdbcf [2025-03-17 04:27:40,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/215552a17/92c5b5ea54824d70aa737229efe516e0 [2025-03-17 04:27:40,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:27:40,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:27:40,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:27:40,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:27:40,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:27:40,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@237cd493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40, skipping insertion in model container [2025-03-17 04:27:40,260 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:27:40,388 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-30.i[916,929] [2025-03-17 04:27:40,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:27:40,526 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:27:40,533 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-30.i[916,929] [2025-03-17 04:27:40,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:27:40,619 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:27:40,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40 WrapperNode [2025-03-17 04:27:40,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:27:40,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:27:40,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:27:40,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:27:40,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,687 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 364 [2025-03-17 04:27:40,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:27:40,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:27:40,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:27:40,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:27:40,695 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,744 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:27:40,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,745 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:27:40,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:27:40,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:27:40,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:27:40,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (1/1) ... [2025-03-17 04:27:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:27:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:27:40,826 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:27:40,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:27:40,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:27:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:27:40,849 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:27:40,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:27:40,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:27:40,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:27:40,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:27:40,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:27:41,568 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L349: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-03-17 04:27:41,622 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-17 04:27:41,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:27:41,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:27:41,635 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:27:41,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:27:41 BoogieIcfgContainer [2025-03-17 04:27:41,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:27:41,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:27:41,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:27:41,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:27:41,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:27:40" (1/3) ... [2025-03-17 04:27:41,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64308f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:27:41, skipping insertion in model container [2025-03-17 04:27:41,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:27:40" (2/3) ... [2025-03-17 04:27:41,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64308f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:27:41, skipping insertion in model container [2025-03-17 04:27:41,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:27:41" (3/3) ... [2025-03-17 04:27:41,643 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-30.i [2025-03-17 04:27:41,677 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:27:41,679 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-30.i that has 2 procedures, 149 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:27:41,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:27:41,739 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;@458338c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:27:41,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:27:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 95 states have internal predecessors, (139), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 04:27:41,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-17 04:27:41,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:41,760 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:27:41,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:41,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1285326303, now seen corresponding path program 1 times [2025-03-17 04:27:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:41,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222439383] [2025-03-17 04:27:41,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:41,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:41,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 04:27:41,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 04:27:41,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:41,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:42,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-17 04:27:42,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222439383] [2025-03-17 04:27:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222439383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:42,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 04:27:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246257280] [2025-03-17 04:27:42,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:42,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:27:42,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:42,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:27:42,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:27:42,346 INFO L87 Difference]: Start difference. First operand has 149 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 95 states have internal predecessors, (139), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:42,377 INFO L93 Difference]: Finished difference Result 295 states and 536 transitions. [2025-03-17 04:27:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:27:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 328 [2025-03-17 04:27:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:42,386 INFO L225 Difference]: With dead ends: 295 [2025-03-17 04:27:42,386 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 04:27:42,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:27:42,395 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:42,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:27:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 04:27:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-17 04:27:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 04:27:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 238 transitions. [2025-03-17 04:27:42,437 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 238 transitions. Word has length 328 [2025-03-17 04:27:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:42,441 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 238 transitions. [2025-03-17 04:27:42,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 238 transitions. [2025-03-17 04:27:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:42,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:42,445 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:27:42,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 04:27:42,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:42,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:42,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2000910916, now seen corresponding path program 1 times [2025-03-17 04:27:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714854017] [2025-03-17 04:27:42,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:42,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:42,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:42,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:42,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:42,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-17 04:27:42,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:42,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714854017] [2025-03-17 04:27:42,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714854017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:42,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:42,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:42,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143856699] [2025-03-17 04:27:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:42,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:42,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:42,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:42,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:42,815 INFO L87 Difference]: Start difference. First operand 147 states and 238 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:42,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:42,899 INFO L93 Difference]: Finished difference Result 410 states and 663 transitions. [2025-03-17 04:27:42,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:42,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 330 [2025-03-17 04:27:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:42,905 INFO L225 Difference]: With dead ends: 410 [2025-03-17 04:27:42,906 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 04:27:42,907 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-17 04:27:42,908 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 165 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:42,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 458 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:27:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 04:27:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2025-03-17 04:27:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 164 states have (on average 1.4329268292682926) internal successors, (235), 165 states have internal predecessors, (235), 94 states have call successors, (94), 2 states have call predecessors, (94), 2 states have return successors, (94), 93 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 04:27:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 423 transitions. [2025-03-17 04:27:42,942 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 423 transitions. Word has length 330 [2025-03-17 04:27:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:42,943 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 423 transitions. [2025-03-17 04:27:42,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 423 transitions. [2025-03-17 04:27:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:42,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:42,948 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:27:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:27:42,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:42,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2129993635, now seen corresponding path program 1 times [2025-03-17 04:27:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:42,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812956947] [2025-03-17 04:27:42,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:42,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:43,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:43,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:43,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-17 04:27:43,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:43,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812956947] [2025-03-17 04:27:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812956947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:43,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:43,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288750975] [2025-03-17 04:27:43,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:43,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:43,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:43,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:43,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:43,244 INFO L87 Difference]: Start difference. First operand 261 states and 423 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:43,321 INFO L93 Difference]: Finished difference Result 675 states and 1091 transitions. [2025-03-17 04:27:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 330 [2025-03-17 04:27:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:43,328 INFO L225 Difference]: With dead ends: 675 [2025-03-17 04:27:43,329 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 04:27:43,330 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-17 04:27:43,331 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 105 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:43,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 477 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:27:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 04:27:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2025-03-17 04:27:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 272 states have (on average 1.4558823529411764) internal successors, (396), 275 states have internal predecessors, (396), 134 states have call successors, (134), 4 states have call predecessors, (134), 4 states have return successors, (134), 131 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-17 04:27:43,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 664 transitions. [2025-03-17 04:27:43,389 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 664 transitions. Word has length 330 [2025-03-17 04:27:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:43,391 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 664 transitions. [2025-03-17 04:27:43,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:43,391 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 664 transitions. [2025-03-17 04:27:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:43,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:43,396 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:27:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:27:43,397 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:43,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2141309762, now seen corresponding path program 1 times [2025-03-17 04:27:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694633360] [2025-03-17 04:27:43,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:43,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:43,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:43,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:43,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:43,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2025-03-17 04:27:43,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:43,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694633360] [2025-03-17 04:27:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694633360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:43,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:43,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:27:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566143533] [2025-03-17 04:27:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:43,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:27:43,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:43,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:27:43,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:27:43,865 INFO L87 Difference]: Start difference. First operand 411 states and 664 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:44,688 INFO L93 Difference]: Finished difference Result 1425 states and 2305 transitions. [2025-03-17 04:27:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:27:44,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 330 [2025-03-17 04:27:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:44,694 INFO L225 Difference]: With dead ends: 1425 [2025-03-17 04:27:44,694 INFO L226 Difference]: Without dead ends: 1015 [2025-03-17 04:27:44,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:27:44,696 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 234 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:44,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 780 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:27:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-17 04:27:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 819. [2025-03-17 04:27:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 542 states have (on average 1.455719557195572) internal successors, (789), 548 states have internal predecessors, (789), 268 states have call successors, (268), 8 states have call predecessors, (268), 8 states have return successors, (268), 262 states have call predecessors, (268), 268 states have call successors, (268) [2025-03-17 04:27:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1325 transitions. [2025-03-17 04:27:44,786 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1325 transitions. Word has length 330 [2025-03-17 04:27:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:44,786 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1325 transitions. [2025-03-17 04:27:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2025-03-17 04:27:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1325 transitions. [2025-03-17 04:27:44,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:44,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:44,791 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:27:44,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:27:44,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:44,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:44,792 INFO L85 PathProgramCache]: Analyzing trace with hash -692077535, now seen corresponding path program 1 times [2025-03-17 04:27:44,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:44,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61948734] [2025-03-17 04:27:44,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:44,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:45,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:45,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat