./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.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_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:35,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:36,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:26:36,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:36,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:36,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:36,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:36,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:36,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:36,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:36,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:36,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:36,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:36,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:36,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:26:36,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:26:36,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:36,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:36,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:36,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:36,045 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-03-04 00:26:36,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:36,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:36,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:36,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:36,256 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:36,257 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-78.i [2025-03-04 00:26:37,447 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d16cc23/35b8f0fd560846b89f85ace6a98f9ab3/FLAG4f47f5e98 [2025-03-04 00:26:37,692 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:37,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-04 00:26:37,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d16cc23/35b8f0fd560846b89f85ace6a98f9ab3/FLAG4f47f5e98 [2025-03-04 00:26:37,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2d16cc23/35b8f0fd560846b89f85ace6a98f9ab3 [2025-03-04 00:26:37,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:37,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:37,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:37,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:37,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:37,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:37,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdd24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37, skipping insertion in model container [2025-03-04 00:26:37,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:37,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:37,847 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-78.i[915,928] [2025-03-04 00:26:37,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:37,904 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:37,915 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-78.i[915,928] [2025-03-04 00:26:37,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:37,951 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:37,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37 WrapperNode [2025-03-04 00:26:37,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:37,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:37,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:37,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:37,959 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:26:37" (1/1) ... [2025-03-04 00:26:37,963 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:26:37" (1/1) ... [2025-03-04 00:26:37,983 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-04 00:26:37,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:37,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:37,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:37,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:37,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:37,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,012 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:26:38,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,016 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:38,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:38,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:38,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:38,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (1/1) ... [2025-03-04 00:26:38,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:38,051 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:26:38,056 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:26:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:38,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:38,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:26:38,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:38,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:38,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:38,118 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:38,342 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:38,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:38,354 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:38,355 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:38,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:38 BoogieIcfgContainer [2025-03-04 00:26:38,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:38,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:38,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:38,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:38,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:37" (1/3) ... [2025-03-04 00:26:38,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec32918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:38, skipping insertion in model container [2025-03-04 00:26:38,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:37" (2/3) ... [2025-03-04 00:26:38,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec32918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:38, skipping insertion in model container [2025-03-04 00:26:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:38" (3/3) ... [2025-03-04 00:26:38,364 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-03-04 00:26:38,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:38,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:38,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:38,428 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;@45e942c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:38,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:26:38,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:38,443 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:38,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:38,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:38,448 INFO L85 PathProgramCache]: Analyzing trace with hash 988486127, now seen corresponding path program 1 times [2025-03-04 00:26:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:38,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510826571] [2025-03-04 00:26:38,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:38,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:38,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:38,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:38,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:38,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:38,676 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:26:38,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:26:38,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510826571] [2025-03-04 00:26:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510826571] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:26:38,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192840139] [2025-03-04 00:26:38,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:38,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:26:38,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:38,682 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:26:38,684 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:26:38,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:38,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:38,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:38,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:38,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:38,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-04 00:26:38,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192840139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:38,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:26:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:26:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320574636] [2025-03-04 00:26:38,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:38,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:38,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:26:38,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:38,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:38,891 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:26:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:38,907 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-03-04 00:26:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:38,909 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-04 00:26:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:38,916 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:26:38,917 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:26:38,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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:26:38,921 INFO L435 NwaCegarLoop]: 75 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, 75 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:26:38,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:38,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:26:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:26:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-04 00:26:38,975 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-03-04 00:26:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:38,976 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 00:26:38,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:26:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-04 00:26:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:26:38,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:38,984 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:38,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:26:39,189 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:26:39,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash -272571536, now seen corresponding path program 1 times [2025-03-04 00:26:39,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:26:39,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068548854] [2025-03-04 00:26:39,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:39,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:26:39,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:39,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:39,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:39,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:39,365 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:26:39,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:39,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:39,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:39,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:26:39,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:26:39,465 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:26:39,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:26:39,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:26:39,471 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 00:26:39,560 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:26:39,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:26:39 BoogieIcfgContainer [2025-03-04 00:26:39,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:26:39,566 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:26:39,566 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:26:39,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:26:39,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:38" (3/4) ... [2025-03-04 00:26:39,569 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:26:39,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:26:39,571 INFO L158 Benchmark]: Toolchain (without parser) took 1847.30ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 70.5MB in the end (delta: 36.0MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2025-03-04 00:26:39,571 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:39,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.24ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 93.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:39,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:26:39,574 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:39,575 INFO L158 Benchmark]: IcfgBuilder took 330.91ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 74.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:26:39,575 INFO L158 Benchmark]: TraceAbstraction took 1207.50ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-04 00:26:39,575 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 70.5MB in the end (delta: 785.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:26:39,577 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 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.24ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 93.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.03ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 91.7MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 90.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 330.91ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 74.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1207.50ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 71.3MB in the end (delta: 2.5MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 70.5MB in the end (delta: 785.1kB). 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 91, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_6 = 128; [L26] signed long int var_1_7 = 10; [L27] signed short int var_1_8 = 0; [L28] signed short int var_1_9 = 25; [L29] signed short int var_1_10 = 32; [L30] signed short int var_1_11 = 1000; [L31] signed short int var_1_12 = 25; [L32] signed short int var_1_13 = 128; [L33] unsigned long int var_1_14 = 5; [L34] float var_1_15 = 8.25; [L35] float var_1_16 = 63.5; [L36] float var_1_17 = -0.6; [L37] signed long int last_1_var_1_1 = -200; VAL [isInitial=0, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L66] var_1_3 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L67] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L68] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=128, var_1_7=10, var_1_8=0, var_1_9=25] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L70] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L71] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=10, var_1_8=0, var_1_9=25] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L74] RET assume_abort_if_not(var_1_7 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=25] [L75] var_1_9 = __VERIFIER_nondet_short() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=32, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L78] var_1_10 = __VERIFIER_nondet_short() [L79] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=1000, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L81] var_1_11 = __VERIFIER_nondet_short() [L82] CALL assume_abort_if_not(var_1_11 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_11 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_11 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_11 <= 8192) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=25, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L84] var_1_12 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_12 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_12 >= -8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_12 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_12 <= 8191) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=128, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L87] var_1_13 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_16=127/2, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L90] var_1_16 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=5, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET updateVariables() [L108] CALL step() [L41] COND TRUE \read(var_1_3) [L42] var_1_14 = (2931747731u - var_1_10) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L44] unsigned char stepLocal_1 = var_1_3; [L45] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, stepLocal_1=-255, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L46] COND FALSE !(var_1_2 && stepLocal_1) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=0, var_1_9=0] [L53] COND FALSE !(var_1_14 > var_1_14) [L56] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=33/4, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L58] COND TRUE var_1_11 >= var_1_1 [L59] var_1_15 = ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))) VAL [isInitial=1, last_1_var_1_1=-200, stepLocal_0=0, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L108] RET step() [L109] CALL, EXPR property() [L99-L100] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_14 > last_1_var_1_1)) ? (var_1_1 == ((signed long int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed long int) var_1_6))) : 1) && ((var_1_14 > var_1_14) ? (var_1_8 == ((signed short int) ((var_1_9 - var_1_10) + ((((-4) < ((var_1_11 + var_1_12))) ? (-4) : ((var_1_11 + var_1_12))))))) : (var_1_8 == ((signed short int) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_13))))) && (var_1_3 ? (var_1_14 == ((unsigned long int) (2931747731u - var_1_10))) : 1)) && ((var_1_11 >= var_1_1) ? (var_1_15 == ((float) ((((var_1_16) > (var_1_17)) ? (var_1_16) : (var_1_17))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-200, var_1_10=16383, var_1_11=-200, var_1_12=0, var_1_13=32766, var_1_14=2931731348, var_1_15=2931731353, var_1_16=2931731353, var_1_17=2931731353, var_1_1=-200, var_1_2=0, var_1_3=-255, var_1_6=-1, var_1_7=0, var_1_8=-32766, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 20, 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, 75 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, 75 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred 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.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1482/1520 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:26:39,598 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_amount25_file-78.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 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:26:41,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:26:41,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:26:41,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:26:41,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:26:41,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:26:41,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:26:41,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:26:41,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:26:41,771 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:26:41,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:26:41,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:26:41,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:26:41,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:26:41,772 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:26:41,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:41,773 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:26:41,773 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:26:41,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:26:41,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:26:41,775 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 -> 776cbeba8a72a8c366fa86377847687b216913b78347eee8ff5c4d62d35f12be [2025-03-04 00:26:42,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:26:42,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:26:42,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:26:42,026 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:26:42,027 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:26:42,029 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-78.i [2025-03-04 00:26:43,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00032c1ff/58f505ca50d54ad7be482573e7a48348/FLAGba0457fc6 [2025-03-04 00:26:43,577 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:43,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-78.i [2025-03-04 00:26:43,588 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00032c1ff/58f505ca50d54ad7be482573e7a48348/FLAGba0457fc6 [2025-03-04 00:26:43,608 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00032c1ff/58f505ca50d54ad7be482573e7a48348 [2025-03-04 00:26:43,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:43,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:43,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:43,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:43,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:43,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@663d1dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43, skipping insertion in model container [2025-03-04 00:26:43,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:43,757 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-78.i[915,928] [2025-03-04 00:26:43,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:43,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:43,830 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-78.i[915,928] [2025-03-04 00:26:43,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:43,877 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:43,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43 WrapperNode [2025-03-04 00:26:43,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:43,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:43,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:43,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:43,885 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:26:43" (1/1) ... [2025-03-04 00:26:43,899 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:26:43" (1/1) ... [2025-03-04 00:26:43,922 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-04 00:26:43,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:43,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:43,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:43,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:43,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,948 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:26:43,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,957 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:43,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:43,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:43,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:43,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (1/1) ... [2025-03-04 00:26:43,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:43,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:44,006 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:26:44,010 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:26:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:44,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:26:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:44,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:44,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:44,096 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:44,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:44,307 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:44,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:44,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:44,315 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:44,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:44 BoogieIcfgContainer [2025-03-04 00:26:44,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:44,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:44,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:44,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:44,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:43" (1/3) ... [2025-03-04 00:26:44,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:44, skipping insertion in model container [2025-03-04 00:26:44,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:43" (2/3) ... [2025-03-04 00:26:44,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c4036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:44, skipping insertion in model container [2025-03-04 00:26:44,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:44" (3/3) ... [2025-03-04 00:26:44,325 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-78.i [2025-03-04 00:26:44,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:44,339 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-78.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:44,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:44,396 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;@2d74197a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:44,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:26:44,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:44,409 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:44,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash 988486127, now seen corresponding path program 1 times [2025-03-04 00:26:44,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:44,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806863193] [2025-03-04 00:26:44,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:44,423 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:26:44,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:44,431 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:26:44,432 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:26:44,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:44,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:44,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:44,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:44,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-04 00:26:44,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:44,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:44,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806863193] [2025-03-04 00:26:44,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806863193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:44,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:44,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:26:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519316361] [2025-03-04 00:26:44,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:44,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:44,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:44,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:44,685 INFO L87 Difference]: Start difference. First operand has 55 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:26:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:44,723 INFO L93 Difference]: Finished difference Result 104 states and 177 transitions. [2025-03-04 00:26:44,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2025-03-04 00:26:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:44,729 INFO L225 Difference]: With dead ends: 104 [2025-03-04 00:26:44,729 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 00:26:44,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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:26:44,734 INFO L435 NwaCegarLoop]: 75 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, 75 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:26:44,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 00:26:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 00:26:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 00:26:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2025-03-04 00:26:44,771 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 125 [2025-03-04 00:26:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:44,771 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2025-03-04 00:26:44,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-04 00:26:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2025-03-04 00:26:44,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 00:26:44,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:44,775 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:44,781 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:26:44,976 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:26:44,976 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:44,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash -272571536, now seen corresponding path program 1 times [2025-03-04 00:26:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782067965] [2025-03-04 00:26:44,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:44,977 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:26:44,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:44,985 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:26:44,986 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:26:45,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 00:26:45,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 00:26:45,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:45,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:45,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 00:26:45,123 INFO L279 TraceCheckSpWp]: Computing forward predicates...