./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.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 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:44:22,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:44:22,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:44:22,725 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:44:22,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:44:22,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:44:22,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:44:22,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:44:22,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:44:22,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:44:22,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:44:22,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:44:22,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:44:22,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:44:22,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:22,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:44:22,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:44:22,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:44:22,752 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 -> 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 [2025-03-08 13:44:22,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:44:22,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:44:22,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:44:22,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:44:22,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:44:22,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:24,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74757dc9b/9d2959ea3a034e948dcf227e19d18caa/FLAG6e5de98ed [2025-03-08 13:44:24,378 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:44:24,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:24,387 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74757dc9b/9d2959ea3a034e948dcf227e19d18caa/FLAG6e5de98ed [2025-03-08 13:44:24,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74757dc9b/9d2959ea3a034e948dcf227e19d18caa [2025-03-08 13:44:24,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:44:24,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:44:24,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:24,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:44:24,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:44:24,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:24,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f4b53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24, skipping insertion in model container [2025-03-08 13:44:24,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:24,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:44:24,850 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_floatingpointinfluence_no-floats_file-17.i[916,929] [2025-03-08 13:44:24,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:24,905 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:44:24,914 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_floatingpointinfluence_no-floats_file-17.i[916,929] [2025-03-08 13:44:24,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:24,956 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:44:24,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24 WrapperNode [2025-03-08 13:44:24,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:24,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:24,958 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:44:24,958 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:44:24,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:24,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,001 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 13:44:25,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:25,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:44:25,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:44:25,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:44:25,012 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:44:25,027 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,033 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:44:25,036 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:44:25,036 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:44:25,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:44:25,037 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (1/1) ... [2025-03-08 13:44:25,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:25,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:44:25,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:44:25,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:44:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:44:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:44:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:44:25,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:44:25,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:44:25,152 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:44:25,153 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:44:25,369 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:44:25,370 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:44:25,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:44:25,379 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:44:25,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:25 BoogieIcfgContainer [2025-03-08 13:44:25,379 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:44:25,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:44:25,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:44:25,389 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:44:25,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:44:24" (1/3) ... [2025-03-08 13:44:25,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70764ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:25, skipping insertion in model container [2025-03-08 13:44:25,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:24" (2/3) ... [2025-03-08 13:44:25,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70764ed1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:25, skipping insertion in model container [2025-03-08 13:44:25,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:25" (3/3) ... [2025-03-08 13:44:25,391 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:25,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:44:25,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-17.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:44:25,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:44:25,471 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;@3d3a6b11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:44:25,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:44:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:44:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 13:44:25,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:25,485 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:25,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:25,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1838504167, now seen corresponding path program 1 times [2025-03-08 13:44:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539972691] [2025-03-08 13:44:25,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:25,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:25,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:25,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:25,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:25,704 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:44:25,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:44:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539972691] [2025-03-08 13:44:25,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539972691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:44:25,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375561228] [2025-03-08 13:44:25,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:25,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:44:25,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:25,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:44:25,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:44:25,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:25,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:25,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:25,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:25,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:25,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:25,842 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-03-08 13:44:25,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:25,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375561228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:25,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:44:25,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:44:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871313367] [2025-03-08 13:44:25,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:25,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:25,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:44:25,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:25,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:25,866 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:44:25,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:25,890 INFO L93 Difference]: Finished difference Result 110 states and 193 transitions. [2025-03-08 13:44:25,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:25,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2025-03-08 13:44:25,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:25,896 INFO L225 Difference]: With dead ends: 110 [2025-03-08 13:44:25,896 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 13:44:25,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:25,902 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:25,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:25,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 13:44:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 13:44:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:44:25,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-03-08 13:44:25,928 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 134 [2025-03-08 13:44:25,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:25,928 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-03-08 13:44:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:44:25,928 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-03-08 13:44:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 13:44:25,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:25,930 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:25,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:44:26,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:44:26,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:26,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:26,135 INFO L85 PathProgramCache]: Analyzing trace with hash -580933561, now seen corresponding path program 1 times [2025-03-08 13:44:26,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:44:26,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622462297] [2025-03-08 13:44:26,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:44:26,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:26,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:26,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:26,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:26,234 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:44:26,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:26,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:26,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:26,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:26,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:44:26,320 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:44:26,321 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:44:26,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:44:26,324 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 13:44:26,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:44:26,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:44:26 BoogieIcfgContainer [2025-03-08 13:44:26,405 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:44:26,406 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:44:26,406 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:44:26,406 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:44:26,407 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:25" (3/4) ... [2025-03-08 13:44:26,409 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:44:26,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:44:26,410 INFO L158 Benchmark]: Toolchain (without parser) took 1684.37ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 69.6MB in the end (delta: 36.8MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2025-03-08 13:44:26,410 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:26,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.37ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:44:26,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:44:26,410 INFO L158 Benchmark]: Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:26,411 INFO L158 Benchmark]: IcfgBuilder took 343.73ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 71.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:44:26,411 INFO L158 Benchmark]: TraceAbstraction took 1023.80ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 70.3MB in the end (delta: 167.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2025-03-08 13:44:26,411 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 69.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:44:26,412 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.37ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 93.3MB in the end (delta: 12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.15ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 90.6MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.41ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 88.0MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.73ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 71.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1023.80ms. Allocated memory is still 142.6MB. Free memory was 70.5MB in the beginning and 70.3MB in the end (delta: 167.6kB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 142.6MB. Free memory was 69.6MB in the beginning and 69.6MB in the end (delta: 41.6kB). 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 to_int at line 109, overapproximation of to_int at line 67, overapproximation of to_int at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 10000000; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 16; [L25] signed long int var_1_4 = 7; [L26] signed long int var_1_5 = 49; [L27] signed short int var_1_6 = -10; [L28] signed long int var_1_7 = 4; [L29] signed long int var_1_8 = 9; [L30] signed short int var_1_9 = 128; [L31] signed short int var_1_10 = 128; [L32] unsigned char var_1_11 = 0; [L33] unsigned long int var_1_12 = 100; [L34] signed long int var_1_13 = 128; [L35] signed long int var_1_14 = 3; [L36] unsigned char var_1_15 = 16; [L37] unsigned char var_1_16 = 2; [L38] unsigned char last_1_var_1_15 = 16; VAL [isInitial=0, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=0, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=0, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=16, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L74] var_1_3 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L75] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L76] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L76] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=7, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L77] var_1_4 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L78] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L79] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L79] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=49, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L80] var_1_5 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L81] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L82] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L82] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=4, var_1_8=9, var_1_9=128] [L83] var_1_7 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L84] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L85] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L85] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=9, var_1_9=128] [L86] var_1_8 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L87] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L88] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L88] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=128] [L89] var_1_9 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L90] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L91] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L91] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=128, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L92] var_1_10 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L93] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L94] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L94] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=0, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L95] var_1_11 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L96] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L97] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L97] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=3, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L98] var_1_14 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L99] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L100] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L100] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=2, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L101] var_1_16 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L102] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L103] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L103] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=100, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L117] RET updateVariables() [L118] CALL step() [L42] var_1_12 = last_1_var_1_15 [L43] unsigned long int stepLocal_1 = var_1_12; [L44] signed short int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_15=16, stepLocal_0=16383, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L45] COND FALSE !(stepLocal_0 >= var_1_10) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000000, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L52] COND TRUE \read(var_1_2) [L53] var_1_1 = (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=-10, var_1_7=0, var_1_8=1, var_1_9=16383] [L55] COND TRUE (- (var_1_7 - var_1_8)) <= var_1_3 [L56] var_1_6 = ((8 + var_1_15) - var_1_15) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=128, var_1_14=0, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=16383] [L66] COND TRUE var_1_7 < (var_1_8 - var_1_14) [L67] var_1_13 = ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))) VAL [isInitial=1, last_1_var_1_15=16, stepLocal_1=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_14=0, var_1_15=16, var_1_16=0, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=16383] [L118] RET step() [L119] CALL, EXPR property() [L109-L110] return ((((var_1_2 ? (var_1_1 == ((signed long int) (var_1_3 + ((((var_1_4) < ((49.5 + var_1_5))) ? (var_1_4) : ((49.5 + var_1_5))))))) : 1) && (((- (var_1_7 - var_1_8)) <= var_1_3) ? (var_1_6 == ((signed short int) ((8 + var_1_15) - var_1_15))) : (var_1_2 ? (var_1_11 ? (var_1_6 == ((signed short int) var_1_15)) : 1) : (var_1_6 == ((signed short int) var_1_15))))) && (var_1_12 == ((unsigned long int) last_1_var_1_15))) && ((var_1_7 < (var_1_8 - var_1_14)) ? (var_1_13 == ((signed long int) ((((var_1_4) > (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3))))) ? (var_1_4) : (((((((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) > (var_1_3)) ? (((((127.4f) > (var_1_5)) ? (127.4f) : (var_1_5)))) : (var_1_3)))))))) : 1)) && ((var_1_9 >= var_1_10) ? (((var_1_9 + last_1_var_1_15) >= var_1_12) ? (var_1_15 == ((unsigned char) var_1_16)) : (var_1_15 == ((unsigned char) var_1_16))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000001, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=16383] [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000001, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=16, var_1_10=16384, var_1_11=1, var_1_12=16, var_1_13=10000003, var_1_14=0, var_1_15=16, var_1_16=0, var_1_1=10000001, var_1_2=1, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=8, var_1_7=0, var_1_8=1, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 110 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 83 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, 83 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 402 NumberOfCodeBlocks, 402 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 266 SizeOfPredicates, 0 NumberOfNonLiveVariables, 304 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1806/1848 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:44:26,430 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_floatingpointinfluence_no-floats_file-17.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 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:44:28,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:44:28,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:44:28,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:44:28,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:44:28,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:44:28,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:44:28,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:44:28,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:44:28,415 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:44:28,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:44:28,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:44:28,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:44:28,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:44:28,416 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:44:28,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:44:28,417 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:44:28,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:44:28,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:28,419 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:44:28,419 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:44:28,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:44:28,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:44:28,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:44:28,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:44:28,420 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 -> 45b46b3ee7f86f7814cd473dd2f0c3b871541d9116dfda6389a1ac1f27734388 [2025-03-08 13:44:28,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:44:28,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:44:28,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:44:28,680 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:44:28,680 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:44:28,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:29,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58eecb44f/a71b2c46b3a2482598f4844550db7aa6/FLAG7c69007a6 [2025-03-08 13:44:30,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:44:30,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:30,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58eecb44f/a71b2c46b3a2482598f4844550db7aa6/FLAG7c69007a6 [2025-03-08 13:44:30,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58eecb44f/a71b2c46b3a2482598f4844550db7aa6 [2025-03-08 13:44:30,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:44:30,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:44:30,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:30,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:44:30,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:44:30,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53393900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30, skipping insertion in model container [2025-03-08 13:44:30,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:44:30,172 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_floatingpointinfluence_no-floats_file-17.i[916,929] [2025-03-08 13:44:30,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:30,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:44:30,219 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_floatingpointinfluence_no-floats_file-17.i[916,929] [2025-03-08 13:44:30,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:44:30,248 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:44:30,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30 WrapperNode [2025-03-08 13:44:30,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:44:30,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:30,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:44:30,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:44:30,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,287 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2025-03-08 13:44:30,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:44:30,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:44:30,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:44:30,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:44:30,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:44:30,324 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:44:30,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:44:30,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:44:30,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:44:30,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (1/1) ... [2025-03-08 13:44:30,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:44:30,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:44:30,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:44:30,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:44:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:44:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:44:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:44:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:44:30,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:44:30,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:44:30,473 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:44:30,475 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:44:39,857 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 13:44:39,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:44:39,864 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:44:39,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:44:39,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:39 BoogieIcfgContainer [2025-03-08 13:44:39,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:44:39,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:44:39,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:44:39,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:44:39,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:44:30" (1/3) ... [2025-03-08 13:44:39,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c86a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:39, skipping insertion in model container [2025-03-08 13:44:39,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:44:30" (2/3) ... [2025-03-08 13:44:39,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c86a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:44:39, skipping insertion in model container [2025-03-08 13:44:39,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:44:39" (3/3) ... [2025-03-08 13:44:39,872 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-17.i [2025-03-08 13:44:39,880 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:44:39,881 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-17.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:44:39,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:44:39,924 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;@119f7dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:44:39,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:44:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:44:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 13:44:39,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:39,934 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:39,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:39,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:39,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1838504167, now seen corresponding path program 1 times [2025-03-08 13:44:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790869178] [2025-03-08 13:44:39,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:39,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:39,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:39,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:44:40,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:40,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:40,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:40,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:40,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:44:40,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 13:44:40,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:44:40,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:44:40,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790869178] [2025-03-08 13:44:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790869178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:44:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:44:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:44:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502791794] [2025-03-08 13:44:40,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:44:40,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:44:40,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:44:40,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:44:40,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:40,266 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:44:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:44:40,281 INFO L93 Difference]: Finished difference Result 110 states and 193 transitions. [2025-03-08 13:44:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:44:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 134 [2025-03-08 13:44:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:44:40,289 INFO L225 Difference]: With dead ends: 110 [2025-03-08 13:44:40,289 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 13:44:40,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:44:40,294 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:44:40,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:44:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 13:44:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 13:44:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 13:44:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2025-03-08 13:44:40,326 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 134 [2025-03-08 13:44:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:44:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2025-03-08 13:44:40,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-03-08 13:44:40,327 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2025-03-08 13:44:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 13:44:40,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:44:40,330 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:44:40,341 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-08 13:44:40,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:40,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:44:40,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:44:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -580933561, now seen corresponding path program 1 times [2025-03-08 13:44:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:44:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901827652] [2025-03-08 13:44:40,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:40,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:44:40,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:44:40,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:44:40,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:44:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:40,810 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:44:40,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:41,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:41,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:41,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:44:41,037 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2025-03-08 13:44:41,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1142615286] [2025-03-08 13:44:41,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:44:41,038 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 13:44:41,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 13:44:41,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 13:44:41,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-08 13:44:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 13:44:41,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 13:44:41,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:44:41,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:44:41,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 13:44:41,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:44:51,353 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:44:59,512 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:07,618 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:15,313 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:23,519 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:31,618 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:39,782 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:47,931 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:45:56,095 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 13:46:00,138 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_9~0))) (and (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (.cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 99.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0)))) (let ((.cse2 (fp.lt .cse3 .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0))) (or (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse0 .cse1)) c_~var_1_1~0) (not .cse2)) (and .cse2 (= c_~var_1_1~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse0 .cse3))))))) (not (bvsge .cse4 ((_ sign_extend 16) c_~var_1_10~0))) (bvsle .cse4 (_ bv16383 32)) (bvsge .cse4 (_ bv0 32)) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_12~0 ((_ zero_extend 24) c_~last_1_var_1_15~0)))) is different from false [2025-03-08 13:46:04,181 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 16) c_~var_1_9~0))) (and (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_4~0)) (.cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 99.0 2.0)) ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0)))) (let ((.cse2 (fp.lt .cse3 .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_3~0))) (or (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse0 .cse1)) c_~var_1_1~0) (not .cse2)) (and .cse2 (= c_~var_1_1~0 ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode .cse0 .cse3))))))) (not (bvsge .cse4 ((_ sign_extend 16) c_~var_1_10~0))) (bvsle .cse4 (_ bv16383 32)) (bvsge .cse4 (_ bv0 32)) (not (= (_ bv0 8) c_~var_1_2~0)) (= c_~var_1_12~0 ((_ zero_extend 24) c_~last_1_var_1_15~0)))) is different from true