./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.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_amount10_file-76.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:05:57,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:05:57,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:05:57,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:05:57,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:05:57,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:05:57,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:05:57,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:05:57,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:05:57,552 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:05:57,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:05:57,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:05:57,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:05:57,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:05:57,553 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:05:57,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:05:57,553 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:05:57,553 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:05:57,553 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:05:57,554 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:05:57,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:57,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:05:57,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:05:57,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:05:57,556 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2025-03-04 00:05:57,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:05:57,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:05:57,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:05:57,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:05:57,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:05:57,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2025-03-04 00:05:58,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8172c7859/8a9b0654f0d24854a9f347315045faad/FLAGcc721aa93 [2025-03-04 00:05:59,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:05:59,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2025-03-04 00:05:59,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8172c7859/8a9b0654f0d24854a9f347315045faad/FLAGcc721aa93 [2025-03-04 00:05:59,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8172c7859/8a9b0654f0d24854a9f347315045faad [2025-03-04 00:05:59,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:05:59,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:05:59,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:59,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:05:59,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:05:59,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761ddc80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59, skipping insertion in model container [2025-03-04 00:05:59,507 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:05:59,612 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_amount10_file-76.i[915,928] [2025-03-04 00:05:59,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:59,649 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:05:59,659 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_amount10_file-76.i[915,928] [2025-03-04 00:05:59,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:05:59,682 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:05:59,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59 WrapperNode [2025-03-04 00:05:59,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:05:59,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:59,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:05:59,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:05:59,688 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:05:59" (1/1) ... [2025-03-04 00:05:59,696 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:05:59" (1/1) ... [2025-03-04 00:05:59,715 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2025-03-04 00:05:59,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:05:59,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:05:59,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:05:59,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:05:59,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,737 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:05:59,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:05:59,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:05:59,747 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:05:59,747 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:05:59,748 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (1/1) ... [2025-03-04 00:05:59,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:05:59,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:05:59,769 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:05:59,773 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:05:59,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:05:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:05:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:05:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:05:59,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:05:59,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:05:59,834 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:05:59,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:05:59,938 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:05:59,938 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:05:59,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:05:59,944 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:05:59,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:59 BoogieIcfgContainer [2025-03-04 00:05:59,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:05:59,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:05:59,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:05:59,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:05:59,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:05:59" (1/3) ... [2025-03-04 00:05:59,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38392d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:59, skipping insertion in model container [2025-03-04 00:05:59,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:05:59" (2/3) ... [2025-03-04 00:05:59,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38392d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:05:59, skipping insertion in model container [2025-03-04 00:05:59,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:59" (3/3) ... [2025-03-04 00:05:59,951 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2025-03-04 00:05:59,960 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:05:59,963 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-76.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:00,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:00,014 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;@68ca7837, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:00,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:00,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:00,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:00,025 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:00,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 263192951, now seen corresponding path program 1 times [2025-03-04 00:06:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:00,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274783789] [2025-03-04 00:06:00,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:00,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:00,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:00,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:00,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:06:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:06:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274783789] [2025-03-04 00:06:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274783789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:06:00,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312268165] [2025-03-04 00:06:00,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:00,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:06:00,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:00,185 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:06:00,187 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:06:00,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:00,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:00,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:00,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:00,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:00,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 00:06:00,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312268165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:00,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:06:00,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:06:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946780055] [2025-03-04 00:06:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:00,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:00,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:06:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:00,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:00,294 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:06:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:00,305 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2025-03-04 00:06:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2025-03-04 00:06:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:00,310 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:06:00,310 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:06:00,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 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:06:00,314 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:00,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:06:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:06:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:06:00,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2025-03-04 00:06:00,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:00,340 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:06:00,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:06:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:06:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:00,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:00,341 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:00,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:06:00,545 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:06:00,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:00,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:00,545 INFO L85 PathProgramCache]: Analyzing trace with hash 662098746, now seen corresponding path program 1 times [2025-03-04 00:06:00,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:00,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041798091] [2025-03-04 00:06:00,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:00,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:00,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:00,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:00,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:00,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 00:06:00,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:06:00,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041798091] [2025-03-04 00:06:00,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041798091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:00,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:00,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:06:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214057093] [2025-03-04 00:06:00,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:00,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:06:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:06:00,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:06:00,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:06:00,812 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 00:06:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:00,874 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-03-04 00:06:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:06:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2025-03-04 00:06:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:00,875 INFO L225 Difference]: With dead ends: 57 [2025-03-04 00:06:00,875 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:06:00,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:06:00,876 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:00,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:06:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:06:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 00:06:00,881 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2025-03-04 00:06:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:00,882 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 00:06:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 00:06:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-04 00:06:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:00,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:00,883 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:00,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:06:00,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:00,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:00,884 INFO L85 PathProgramCache]: Analyzing trace with hash 690727897, now seen corresponding path program 1 times [2025-03-04 00:06:00,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:06:00,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393478628] [2025-03-04 00:06:00,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:00,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:06:00,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:00,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:00,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:00,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:00,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:06:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:00,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:00,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:00,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:06:00,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:06:00,963 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:06:00,964 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:06:00,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:06:00,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:06:00,999 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:06:01,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:06:01 BoogieIcfgContainer [2025-03-04 00:06:01,003 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:06:01,004 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:06:01,004 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:06:01,004 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:06:01,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:05:59" (3/4) ... [2025-03-04 00:06:01,006 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:06:01,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:06:01,007 INFO L158 Benchmark]: Toolchain (without parser) took 1504.80ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 78.6MB in the end (delta: 27.5MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2025-03-04 00:06:01,007 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:01,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.46ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:01,008 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.77ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 832.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:01,008 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:01,008 INFO L158 Benchmark]: IcfgBuilder took 197.81ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:06:01,009 INFO L158 Benchmark]: TraceAbstraction took 1056.80ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 79.4MB in the end (delta: -851.8kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-04 00:06:01,009 INFO L158 Benchmark]: Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 78.6MB in the end (delta: 797.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:06:01,010 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.46ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 94.2MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.77ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 93.4MB in the end (delta: 832.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 91.2MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 197.81ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 78.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1056.80ms. Allocated memory is still 142.6MB. Free memory was 78.5MB in the beginning and 79.4MB in the end (delta: -851.8kB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 2.53ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 78.6MB in the end (delta: 797.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.81; [L23] float var_1_3 = 256.25; [L24] float var_1_4 = 1.75; [L25] double var_1_5 = 10000000.5; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 0; [L29] signed char var_1_10 = 5; [L30] double last_1_var_1_1 = 32.81; [L31] unsigned char last_1_var_1_6 = 0; VAL [isInitial=0, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L66] isInitial = 1 [L67] FCALL initially() [L68] COND TRUE 1 [L69] CALL updateLastVariables() [L58] last_1_var_1_1 = var_1_1 [L59] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_3=1025/4, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L69] RET updateLastVariables() [L70] CALL updateVariables() [L44] var_1_3 = __VERIFIER_nondet_float() [L45] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L45] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_4=7/4, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L46] var_1_4 = __VERIFIER_nondet_float() [L47] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L47] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_5=20000001/2, var_1_6=0, var_1_8=0, var_1_9=0] [L48] var_1_5 = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L49] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L50] var_1_8 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L51] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_9=0] [L52] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L52] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L53] var_1_9 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L54] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0] [L55] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L55] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L70] RET updateVariables() [L71] CALL step() [L35] COND FALSE !(last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L38] COND FALSE !(\read(last_1_var_1_6)) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=5, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L41] var_1_10 = -50 VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L71] RET step() [L72] CALL, EXPR property() [L62-L63] return (((last_1_var_1_1 < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))) - 199.2f)) ? (var_1_1 == ((double) var_1_5)) : 1) && (last_1_var_1_6 ? (var_1_6 == ((unsigned char) (! (var_1_8 || var_1_9)))) : 1)) && (var_1_10 == ((signed char) -50)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L72] RET, EXPR property() [L72] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=3281/100, last_1_var_1_6=0, var_1_10=-50, var_1_1=3281/100, var_1_6=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 72 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 240/252 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:06:01,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_amount10_file-76.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:06:02,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:06:02,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:06:02,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:06:02,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:06:02,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:06:02,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:06:02,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:06:02,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:06:02,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:06:02,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:06:02,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:06:02,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:06:02,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:06:02,902 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:06:02,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:06:02,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:06:02,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:06:02,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:02,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:06:02,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:06:02,906 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 -> b286836f98ea28c8d142c9f806621ee4793004eb1aab8be8357681e891f9ba79 [2025-03-04 00:06:03,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:06:03,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:06:03,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:06:03,160 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:06:03,160 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:06:03,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2025-03-04 00:06:04,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b256dd6/882ca5dc6f0145cb91841376aab797ee/FLAG146dc2a49 [2025-03-04 00:06:04,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:06:04,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-76.i [2025-03-04 00:06:04,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b256dd6/882ca5dc6f0145cb91841376aab797ee/FLAG146dc2a49 [2025-03-04 00:06:04,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03b256dd6/882ca5dc6f0145cb91841376aab797ee [2025-03-04 00:06:04,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:06:04,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:06:04,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:04,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:06:04,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:06:04,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9be0c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04, skipping insertion in model container [2025-03-04 00:06:04,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:06:04,719 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_amount10_file-76.i[915,928] [2025-03-04 00:06:04,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:04,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:06:04,770 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_amount10_file-76.i[915,928] [2025-03-04 00:06:04,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:06:04,790 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:06:04,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04 WrapperNode [2025-03-04 00:06:04,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:06:04,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:04,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:06:04,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:06:04,797 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:06:04" (1/1) ... [2025-03-04 00:06:04,808 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:06:04" (1/1) ... [2025-03-04 00:06:04,821 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2025-03-04 00:06:04,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:06:04,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:06:04,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:06:04,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:06:04,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,838 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:06:04,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:06:04,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:06:04,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:06:04,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:06:04,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (1/1) ... [2025-03-04 00:06:04,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:06:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:06:04,872 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:06:04,874 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:06:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:06:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:06:04,889 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:06:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:06:04,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:06:04,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:06:04,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:06:04,938 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:06:05,769 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:06:05,769 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:06:05,778 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:06:05,778 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:06:05,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:05 BoogieIcfgContainer [2025-03-04 00:06:05,779 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:06:05,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:06:05,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:06:05,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:06:05,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:06:04" (1/3) ... [2025-03-04 00:06:05,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c9436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:05, skipping insertion in model container [2025-03-04 00:06:05,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:06:04" (2/3) ... [2025-03-04 00:06:05,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652c9436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:06:05, skipping insertion in model container [2025-03-04 00:06:05,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:06:05" (3/3) ... [2025-03-04 00:06:05,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-76.i [2025-03-04 00:06:05,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:06:05,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount10_file-76.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:06:05,841 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:06:05,851 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;@2b9b9202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:06:05,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:06:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:05,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:05,862 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:05,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:05,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 263192951, now seen corresponding path program 1 times [2025-03-04 00:06:05,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62720237] [2025-03-04 00:06:05,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:05,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:05,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:05,877 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:05,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:06:05,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:06,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:06,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:06,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:06,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:06:06,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:06:06,051 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:06,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:06,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62720237] [2025-03-04 00:06:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62720237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:06,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:06,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:06:06,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175368881] [2025-03-04 00:06:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:06,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:06:06,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:06,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:06:06,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:06:06,075 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:06:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:06,091 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2025-03-04 00:06:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:06:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2025-03-04 00:06:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:06,097 INFO L225 Difference]: With dead ends: 60 [2025-03-04 00:06:06,097 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:06:06,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 51 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:06:06,102 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:06,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:06:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:06:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:06:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-04 00:06:06,128 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 52 [2025-03-04 00:06:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:06,129 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-04 00:06:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 00:06:06,130 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-04 00:06:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:06,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:06,132 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:06,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:06:06,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:06,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:06,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:06,334 INFO L85 PathProgramCache]: Analyzing trace with hash 662098746, now seen corresponding path program 1 times [2025-03-04 00:06:06,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:06,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602440913] [2025-03-04 00:06:06,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:06,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:06,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:06,336 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:06,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:06:06,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:06,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:06,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:06,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:06,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:06:06,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 00:06:06,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:06:06,578 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:06:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602440913] [2025-03-04 00:06:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602440913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:06:06,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:06:06,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:06:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009935775] [2025-03-04 00:06:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:06:06,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:06:06,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:06:06,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:06:06,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:06:06,579 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 00:06:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:06:06,851 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2025-03-04 00:06:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:06:06,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 52 [2025-03-04 00:06:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:06:06,861 INFO L225 Difference]: With dead ends: 57 [2025-03-04 00:06:06,861 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 00:06:06,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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:06:06,861 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:06:06,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:06:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 00:06:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 00:06:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 00:06:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-03-04 00:06:06,871 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 52 [2025-03-04 00:06:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:06:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-03-04 00:06:06,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 00:06:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-03-04 00:06:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 00:06:06,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:06:06,875 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 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:06:06,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:06:07,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:07,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:06:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:06:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 690727897, now seen corresponding path program 1 times [2025-03-04 00:06:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:06:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283294803] [2025-03-04 00:06:07,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:06:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:06:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:06:07,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:06:07,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:06:07,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 00:06:07,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 00:06:07,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:06:07,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:06:07,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:06:07,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:06:26,300 WARN L286 SmtUtils]: Spent 8.81s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 00:06:55,767 WARN L286 SmtUtils]: Spent 9.78s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-04 00:07:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 00:07:14,736 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:07:14,736 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:07:14,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283294803] [2025-03-04 00:07:14,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283294803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:07:14,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:07:14,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:07:14,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702327629] [2025-03-04 00:07:14,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:07:14,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:07:14,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:07:14,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:07:14,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:07:14,737 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 00:07:16,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:18,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:20,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:21,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:22,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:25,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:27,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:29,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:30,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:31,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:32,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:33,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:34,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:36,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:38,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:41,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:07:43,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []