./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_amount25_file-36.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 a35769e60951934d6bdd49ba63ee6bf96f7f37fd27fc4fb212883b40db8837ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:32:21,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:32:21,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:32:21,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:32:21,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:32:21,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:32:21,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:32:21,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:32:21,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:32:21,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:32:21,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:32:21,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:32:21,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:32:21,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:32:21,142 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:32:21,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:32:21,142 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:32:21,143 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:32:21,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:32:21,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:32:21,144 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:32:21,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:32:21,145 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 -> a35769e60951934d6bdd49ba63ee6bf96f7f37fd27fc4fb212883b40db8837ed [2025-03-08 15:32:21,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:32:21,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:32:21,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:32:21,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:32:21,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:32:21,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:21,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7def5e/721d3eb2cfc040bcb400f56b1cc63e76/FLAGaa49d789b [2025-03-08 15:32:23,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:32:23,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:23,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7def5e/721d3eb2cfc040bcb400f56b1cc63e76/FLAGaa49d789b [2025-03-08 15:32:23,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7def5e/721d3eb2cfc040bcb400f56b1cc63e76 [2025-03-08 15:32:23,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:32:23,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:32:23,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:32:23,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:32:23,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:32:23,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6c20ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23, skipping insertion in model container [2025-03-08 15:32:23,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:32:23,620 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_amount25_file-36.i[915,928] [2025-03-08 15:32:23,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:32:23,674 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:32:23,682 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_amount25_file-36.i[915,928] [2025-03-08 15:32:23,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:32:23,716 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:32:23,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23 WrapperNode [2025-03-08 15:32:23,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:32:23,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:32:23,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:32:23,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:32:23,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,765 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-08 15:32:23,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:32:23,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:32:23,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:32:23,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:32:23,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,795 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-08 15:32:23,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,810 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:32:23,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:32:23,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:32:23,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:32:23,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (1/1) ... [2025-03-08 15:32:23,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:32:23,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:32:23,844 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-08 15:32:23,848 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-08 15:32:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:32:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:32:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:32:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:32:23,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:32:23,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:32:23,923 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:32:23,924 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:32:24,073 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:32:24,073 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:32:24,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:32:24,081 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:32:24,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:32:24 BoogieIcfgContainer [2025-03-08 15:32:24,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:32:24,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:32:24,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:32:24,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:32:24,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:32:23" (1/3) ... [2025-03-08 15:32:24,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af02e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:32:24, skipping insertion in model container [2025-03-08 15:32:24,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:23" (2/3) ... [2025-03-08 15:32:24,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33af02e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:32:24, skipping insertion in model container [2025-03-08 15:32:24,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:32:24" (3/3) ... [2025-03-08 15:32:24,090 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:24,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:32:24,104 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-36.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:32:24,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:32:24,153 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;@15ae977f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:32:24,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:32:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:32:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:32:24,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:32:24,165 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:32:24,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:32:24,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:32:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash 464555463, now seen corresponding path program 1 times [2025-03-08 15:32:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:32:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100800677] [2025-03-08 15:32:24,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:32:24,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:32:24,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:24,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:24,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:24,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:32:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 15:32:24,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:32:24,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100800677] [2025-03-08 15:32:24,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100800677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:32:24,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045969222] [2025-03-08 15:32:24,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:32:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:32:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:32:24,361 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-08 15:32:24,363 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-08 15:32:24,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:24,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:24,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:24,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:32:24,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:32:24,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:32:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-08 15:32:24,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:32:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045969222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:32:24,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:32:24,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:32:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915030330] [2025-03-08 15:32:24,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:32:24,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:32:24,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:32:24,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:32:24,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:32:24,509 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:32:24,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:32:24,525 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2025-03-08 15:32:24,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:32:24,526 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-08 15:32:24,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:32:24,531 INFO L225 Difference]: With dead ends: 72 [2025-03-08 15:32:24,532 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 15:32:24,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-08 15:32:24,535 INFO L435 NwaCegarLoop]: 49 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, 49 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-08 15:32:24,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:32:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 15:32:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 15:32:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:32:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 15:32:24,562 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 64 [2025-03-08 15:32:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:32:24,562 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 15:32:24,563 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:32:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 15:32:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:32:24,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:32:24,565 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:32:24,572 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-08 15:32:24,765 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-08 15:32:24,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:32:24,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:32:24,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1345361860, now seen corresponding path program 1 times [2025-03-08 15:32:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:32:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814768769] [2025-03-08 15:32:24,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:32:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:32:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:24,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:24,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:24,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:32:24,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:32:24,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:24,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:24,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:24,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:32:24,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:32:24,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:32:24,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:32:24,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:32:24,919 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 15:32:24,952 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:32:24,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:32:24 BoogieIcfgContainer [2025-03-08 15:32:24,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:32:24,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:32:24,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:32:24,955 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:32:24,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:32:24" (3/4) ... [2025-03-08 15:32:24,957 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:32:24,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:32:24,958 INFO L158 Benchmark]: Toolchain (without parser) took 1457.37ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 103.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-08 15:32:24,958 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:32:24,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 95.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:32:24,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.53ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:32:24,959 INFO L158 Benchmark]: Boogie Preprocessor took 47.71ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:32:24,959 INFO L158 Benchmark]: IcfgBuilder took 267.26ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:32:24,959 INFO L158 Benchmark]: TraceAbstraction took 870.65ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 103.8MB in the end (delta: -26.0MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-03-08 15:32:24,959 INFO L158 Benchmark]: Witness Printer took 2.54ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 103.6MB in the end (delta: 152.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:32:24,960 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.58ms. Allocated memory is still 201.3MB. Free memory is still 117.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 95.9MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.53ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 47.71ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 267.26ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 78.3MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 870.65ms. Allocated memory is still 142.6MB. Free memory was 77.7MB in the beginning and 103.8MB in the end (delta: -26.0MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Witness Printer took 2.54ms. Allocated memory is still 142.6MB. Free memory was 103.8MB in the beginning and 103.6MB in the end (delta: 152.9kB). 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 63, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] float var_1_6 = 2.375; [L25] float var_1_7 = 10.8; [L26] double var_1_9 = 9.6; [L27] double var_1_12 = 128.5; [L28] unsigned char var_1_13 = 128; [L29] float var_1_14 = 8.5; [L30] unsigned char var_1_15 = 128; [L31] unsigned char last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=0, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L81] isInitial = 1 [L82] FCALL initially() [L83] COND TRUE 1 [L84] CALL updateLastVariables() [L74] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=0, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L84] RET updateLastVariables() [L85] CALL updateVariables() [L57] var_1_4 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L58] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L59] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L59] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_6=19/8, var_1_7=54/5, var_1_9=48/5] [L60] var_1_6 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L61] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_7=54/5, var_1_9=48/5] [L62] var_1_7 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L63] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=257/2, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L64] var_1_12 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L65] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_14=17/2, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L66] var_1_14 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L67] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L68] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L68] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=128, var_1_1=1, var_1_4=1, var_1_9=48/5] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L70] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L71] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L71] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=128, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=48/5] [L85] RET updateVariables() [L86] CALL step() [L35] COND TRUE ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < (last_1_var_1_13 + last_1_var_1_13) [L36] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=128, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L38] COND TRUE var_1_9 <= (16.2f / var_1_14) [L39] var_1_13 = (var_1_15 - 5) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L41] unsigned char stepLocal_0 = var_1_9 > var_1_9; VAL [isInitial=1, last_1_var_1_13=128, stepLocal_0=0, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=1, var_1_4=1, var_1_9=254] [L42] COND FALSE !(stepLocal_0 && var_1_4) [L53] var_1_1 = var_1_13 VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L86] RET step() [L87] CALL, EXPR property() [L77-L78] return ((((var_1_9 > var_1_9) && var_1_4) ? ((((((var_1_9) > ((- var_1_9))) ? (var_1_9) : ((- var_1_9)))) != var_1_9) ? ((! (var_1_9 >= (var_1_6 - var_1_7))) ? (var_1_1 == ((unsigned long int) var_1_13)) : (var_1_1 == ((unsigned long int) var_1_13))) : (var_1_1 == ((unsigned long int) var_1_13))) : (var_1_1 == ((unsigned long int) var_1_13))) && ((((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < (last_1_var_1_13 + last_1_var_1_13)) ? (var_1_9 == ((double) var_1_12)) : 1)) && ((var_1_9 <= (16.2f / var_1_14)) ? (var_1_13 == ((unsigned char) (var_1_15 - 5))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=128, var_1_12=254, var_1_13=249, var_1_15=-2, var_1_1=249, var_1_4=1, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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-08 15:32:24,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_amount25_file-36.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 a35769e60951934d6bdd49ba63ee6bf96f7f37fd27fc4fb212883b40db8837ed --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:32:26,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:32:26,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:32:26,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:32:26,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:32:26,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:32:26,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:32:26,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:32:26,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:32:26,905 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:32:26,905 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:32:26,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:32:26,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:32:26,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:32:26,905 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:32:26,905 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:32:26,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:32:26,907 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:32:26,908 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:32:26,908 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:32:26,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:32:26,908 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 -> a35769e60951934d6bdd49ba63ee6bf96f7f37fd27fc4fb212883b40db8837ed [2025-03-08 15:32:27,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:32:27,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:32:27,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:32:27,182 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:32:27,184 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:32:27,185 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:28,368 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd9afb9f/c2735176b8c04fd591d3843e067b100e/FLAG6425febed [2025-03-08 15:32:28,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:32:28,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:28,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd9afb9f/c2735176b8c04fd591d3843e067b100e/FLAG6425febed [2025-03-08 15:32:28,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd9afb9f/c2735176b8c04fd591d3843e067b100e [2025-03-08 15:32:28,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:32:28,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:32:28,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:32:28,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:32:28,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:32:28,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bfbf4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28, skipping insertion in model container [2025-03-08 15:32:28,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:32:28,687 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_amount25_file-36.i[915,928] [2025-03-08 15:32:28,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:32:28,737 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:32:28,746 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_amount25_file-36.i[915,928] [2025-03-08 15:32:28,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:32:28,782 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:32:28,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28 WrapperNode [2025-03-08 15:32:28,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:32:28,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:32:28,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:32:28,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:32:28,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,815 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 81 [2025-03-08 15:32:28,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:32:28,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:32:28,816 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:32:28,816 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:32:28,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,841 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-08 15:32:28,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,846 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,846 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,847 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,848 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:32:28,850 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:32:28,850 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:32:28,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:32:28,851 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (1/1) ... [2025-03-08 15:32:28,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:32:28,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:32:28,879 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-08 15:32:28,884 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-08 15:32:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:32:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:32:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:32:28,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:32:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:32:28,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:32:28,958 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:32:28,960 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:32:32,449 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:32:32,449 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:32:32,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:32:32,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:32:32,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:32:32 BoogieIcfgContainer [2025-03-08 15:32:32,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:32:32,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:32:32,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:32:32,463 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:32:32,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:32:28" (1/3) ... [2025-03-08 15:32:32,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf5ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:32:32, skipping insertion in model container [2025-03-08 15:32:32,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:32:28" (2/3) ... [2025-03-08 15:32:32,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54cf5ef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:32:32, skipping insertion in model container [2025-03-08 15:32:32,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:32:32" (3/3) ... [2025-03-08 15:32:32,466 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-36.i [2025-03-08 15:32:32,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:32:32,479 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-36.i that has 2 procedures, 39 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:32:32,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:32:32,523 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;@7c0ee96c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:32:32,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:32:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:32:32,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:32:32,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:32:32,532 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:32:32,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:32:32,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:32:32,536 INFO L85 PathProgramCache]: Analyzing trace with hash 464555463, now seen corresponding path program 1 times [2025-03-08 15:32:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:32:32,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033831003] [2025-03-08 15:32:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:32:32,543 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-08 15:32:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:32:32,546 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-08 15:32:32,547 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-08 15:32:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:32,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:32,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:32,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:32:32,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:32:32,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:32:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 15:32:32,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:32:32,826 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:32:32,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033831003] [2025-03-08 15:32:32,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033831003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:32:32,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:32:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:32:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792443294] [2025-03-08 15:32:32,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:32:32,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:32:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:32:32,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:32:32,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:32:32,849 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:32:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:32:32,867 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2025-03-08 15:32:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:32:32,868 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2025-03-08 15:32:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:32:32,874 INFO L225 Difference]: With dead ends: 72 [2025-03-08 15:32:32,875 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 15:32:32,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 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-08 15:32:32,881 INFO L435 NwaCegarLoop]: 49 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, 49 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-08 15:32:32,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:32:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 15:32:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-08 15:32:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 15:32:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-08 15:32:32,917 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 64 [2025-03-08 15:32:32,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:32:32,918 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-08 15:32:32,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 15:32:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-08 15:32:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 15:32:32,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:32:32,920 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:32:32,930 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 15:32:33,120 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-08 15:32:33,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:32:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:32:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1345361860, now seen corresponding path program 1 times [2025-03-08 15:32:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:32:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769203183] [2025-03-08 15:32:33,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:32:33,122 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-08 15:32:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:32:33,124 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-08 15:32:33,125 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-08 15:32:33,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 15:32:33,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 15:32:33,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:32:33,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:32:33,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 15:32:33,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:33:05,277 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 15:33:52,645 WARN L286 SmtUtils]: Spent 10.93s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)