./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.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_codestructure_dependencies_file-18.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 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:45:47,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:45:47,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:45:47,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:45:47,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:45:47,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:45:47,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:45:47,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:45:47,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:45:47,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:45:47,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:45:47,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:45:47,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:45:47,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:45:47,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:45:47,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:45:47,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:45:47,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:47,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:45:47,857 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:45:47,858 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:45:47,858 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 -> 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 [2025-03-08 09:45:48,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:45:48,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:45:48,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:45:48,102 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:45:48,102 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:45:48,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-08 09:45:49,229 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902921f5b/ef14284bc362490fad54766a81cfca4f/FLAGcf985226c [2025-03-08 09:45:49,478 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:45:49,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-08 09:45:49,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902921f5b/ef14284bc362490fad54766a81cfca4f/FLAGcf985226c [2025-03-08 09:45:49,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902921f5b/ef14284bc362490fad54766a81cfca4f [2025-03-08 09:45:49,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:45:49,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:45:49,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:49,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:45:49,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:45:49,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ae290 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49, skipping insertion in model container [2025-03-08 09:45:49,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:45:49,633 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_codestructure_dependencies_file-18.i[919,932] [2025-03-08 09:45:49,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:49,686 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:45:49,694 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_codestructure_dependencies_file-18.i[919,932] [2025-03-08 09:45:49,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:49,739 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:45:49,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49 WrapperNode [2025-03-08 09:45:49,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:49,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:49,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:45:49,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:45:49,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,782 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-08 09:45:49,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:49,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:45:49,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:45:49,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:45:49,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,812 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 09:45:49,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,821 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:45:49,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:45:49,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:45:49,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:45:49,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (1/1) ... [2025-03-08 09:45:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:49,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:49,859 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 09:45:49,862 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 09:45:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:45:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:45:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:45:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:45:49,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:45:49,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:45:49,933 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:45:49,935 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:45:50,109 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:45:50,110 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:45:50,118 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:45:50,120 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:45:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:45:50 BoogieIcfgContainer [2025-03-08 09:45:50,121 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:45:50,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:45:50,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:45:50,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:45:50,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:45:49" (1/3) ... [2025-03-08 09:45:50,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135c9273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:45:50, skipping insertion in model container [2025-03-08 09:45:50,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:49" (2/3) ... [2025-03-08 09:45:50,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@135c9273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:45:50, skipping insertion in model container [2025-03-08 09:45:50,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:45:50" (3/3) ... [2025-03-08 09:45:50,127 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-18.i [2025-03-08 09:45:50,136 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:45:50,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-18.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:45:50,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:45:50,185 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;@7fc46d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:45:50,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:45:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 09:45:50,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 09:45:50,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:50,195 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:50,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:50,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:50,200 INFO L85 PathProgramCache]: Analyzing trace with hash -658584126, now seen corresponding path program 1 times [2025-03-08 09:45:50,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:50,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019573409] [2025-03-08 09:45:50,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:50,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:50,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:45:50,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:45:50,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:50,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 09:45:50,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:45:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019573409] [2025-03-08 09:45:50,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019573409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:45:50,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951244932] [2025-03-08 09:45:50,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:50,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:45:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:50,433 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 09:45:50,434 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 09:45:50,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:45:50,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:45:50,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:50,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:45:50,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:45:50,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:45:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-08 09:45:50,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:45:50,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951244932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:45:50,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:45:50,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:45:50,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145211217] [2025-03-08 09:45:50,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:45:50,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:45:50,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:45:50,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:45:50,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:45:50,612 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 09:45:50,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:45:50,626 INFO L93 Difference]: Finished difference Result 102 states and 172 transitions. [2025-03-08 09:45:50,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:45:50,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-08 09:45:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:45:50,632 INFO L225 Difference]: With dead ends: 102 [2025-03-08 09:45:50,633 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 09:45:50,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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 09:45:50,637 INFO L435 NwaCegarLoop]: 76 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, 76 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 09:45:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:45:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 09:45:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 09:45:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 09:45:50,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2025-03-08 09:45:50,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 100 [2025-03-08 09:45:50,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:45:50,662 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2025-03-08 09:45:50,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 09:45:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2025-03-08 09:45:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 09:45:50,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:45:50,665 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:45:50,672 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 09:45:50,866 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 09:45:50,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:45:50,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:45:50,867 INFO L85 PathProgramCache]: Analyzing trace with hash -918809667, now seen corresponding path program 1 times [2025-03-08 09:45:50,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:45:50,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608171951] [2025-03-08 09:45:50,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:45:50,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:45:50,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:45:50,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:45:50,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:50,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:45:50,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:45:50,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:45:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:45:51,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:45:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:45:51,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:45:51,085 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:45:51,086 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:45:51,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:45:51,089 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 09:45:51,151 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:45:51,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:45:51 BoogieIcfgContainer [2025-03-08 09:45:51,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:45:51,154 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:45:51,154 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:45:51,154 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:45:51,154 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:45:50" (3/4) ... [2025-03-08 09:45:51,162 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:45:51,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:45:51,163 INFO L158 Benchmark]: Toolchain (without parser) took 1652.84ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 109.0MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-03-08 09:45:51,163 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:51,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.53ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 109.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:45:51,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:51,163 INFO L158 Benchmark]: Boogie Preprocessor took 45.91ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:51,164 INFO L158 Benchmark]: IcfgBuilder took 290.09ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 87.9MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:45:51,164 INFO L158 Benchmark]: TraceAbstraction took 1030.88ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 109.1MB in the end (delta: -21.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2025-03-08 09:45:51,164 INFO L158 Benchmark]: Witness Printer took 8.81ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 109.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:45:51,166 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.53ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 109.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.91ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 104.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 290.09ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 87.9MB in the end (delta: 16.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1030.88ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 109.1MB in the end (delta: -21.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Witness Printer took 8.81ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 109.0MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryArithmeticFLOAToperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] signed char last_1_var_1_1 = -1; [L39] unsigned char last_1_var_1_10 = 16; [L40] signed long int last_1_var_1_16 = -8; VAL [isInitial=0, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L119] last_1_var_1_1 = var_1_1 [L120] last_1_var_1_10 = var_1_10 [L121] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L131] RET updateLastVariables() [L132] CALL updateVariables() [L92] var_1_3 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L93] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L94] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L94] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=0, var_1_8=-5, var_1_9=2] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_8=-5, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L101] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-5, var_1_9=2] [L102] var_1_8 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L103] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L104] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=2] [L105] var_1_9 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L106] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L107] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L107] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L108] var_1_11 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L110] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L110] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L111] var_1_13 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L112] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L113] var_1_14 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L114] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L115] var_1_15 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L116] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L132] RET updateVariables() [L133] CALL step() [L44] COND FALSE !(var_1_9 < last_1_var_1_16) [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L51] COND TRUE \read(var_1_7) [L52] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_16=-127, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L56] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L57] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=50000004/5, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L63] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L64] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-1, var_1_7=1, var_1_8=-127, var_1_9=16] [L68] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L75] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-8, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L77] COND FALSE !(var_1_1 >= (var_1_16 + var_1_10)) [L88] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L133] RET step() [L134] CALL, EXPR property() [L124-L125] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=-2, var_1_11=-2, var_1_12=10000005, var_1_13=10000005, var_1_14=10000005, var_1_16=-127, var_1_18=-127, var_1_19=10000005, var_1_1=-127, var_1_7=1, var_1_8=-127, var_1_9=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 96 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 76 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, 76 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 198 SizeOfPredicates, 0 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 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 09:45:51,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.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 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:45:52,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:45:53,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:45:53,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:45:53,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:45:53,101 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:45:53,103 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:45:53,103 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:45:53,103 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:45:53,103 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:45:53,104 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:45:53,104 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:45:53,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:45:53,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:45:53,105 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:45:53,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:45:53,105 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:45:53,105 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:45:53,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:45:53,106 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:45:53,106 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:53,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:45:53,107 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:45:53,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:45:53,108 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 -> 03a3293d0395dd319c112da86cc4750b5f2f2545de650ed48e25d08335450b80 [2025-03-08 09:45:53,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:45:53,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:45:53,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:45:53,331 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:45:53,331 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:45:53,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-08 09:45:54,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0bf00c71/0a960cf42b794b31b19099199f49e170/FLAG4b6f52435 [2025-03-08 09:45:54,693 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:45:54,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-18.i [2025-03-08 09:45:54,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0bf00c71/0a960cf42b794b31b19099199f49e170/FLAG4b6f52435 [2025-03-08 09:45:55,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0bf00c71/0a960cf42b794b31b19099199f49e170 [2025-03-08 09:45:55,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:45:55,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:45:55,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:55,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:45:55,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:45:55,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55, skipping insertion in model container [2025-03-08 09:45:55,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:45:55,217 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_codestructure_dependencies_file-18.i[919,932] [2025-03-08 09:45:55,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:55,264 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:45:55,271 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_codestructure_dependencies_file-18.i[919,932] [2025-03-08 09:45:55,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:45:55,302 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:45:55,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55 WrapperNode [2025-03-08 09:45:55,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:45:55,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:55,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:45:55,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:45:55,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,333 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-08 09:45:55,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:45:55,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:45:55,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:45:55,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:45:55,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,359 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 09:45:55,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:45:55,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:45:55,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:45:55,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:45:55,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (1/1) ... [2025-03-08 09:45:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:45:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:45:55,402 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 09:45:55,408 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 09:45:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:45:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:45:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:45:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:45:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:45:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:45:55,487 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:45:55,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:46:18,234 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:46:18,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:46:18,242 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:46:18,242 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:46:18,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:18 BoogieIcfgContainer [2025-03-08 09:46:18,242 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:46:18,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:46:18,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:46:18,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:46:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:45:55" (1/3) ... [2025-03-08 09:46:18,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:18, skipping insertion in model container [2025-03-08 09:46:18,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:45:55" (2/3) ... [2025-03-08 09:46:18,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3dae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:46:18, skipping insertion in model container [2025-03-08 09:46:18,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:46:18" (3/3) ... [2025-03-08 09:46:18,249 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-18.i [2025-03-08 09:46:18,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:46:18,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-18.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:46:18,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:46:18,304 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;@2ebfa1f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:46:18,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:46:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 09:46:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 09:46:18,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:18,317 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:18,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:18,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash -658584126, now seen corresponding path program 1 times [2025-03-08 09:46:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107525243] [2025-03-08 09:46:18,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:18,333 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 09:46:18,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:18,336 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 09:46:18,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 09:46:18,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:46:19,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:46:19,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:19,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:46:19,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:46:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2025-03-08 09:46:19,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:46:19,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:46:19,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107525243] [2025-03-08 09:46:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107525243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:46:19,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:46:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:46:19,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609350689] [2025-03-08 09:46:19,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:46:19,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:46:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:46:19,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:46:19,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:46:19,520 INFO L87 Difference]: Start difference. First operand has 54 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 37 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 09:46:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:46:19,539 INFO L93 Difference]: Finished difference Result 102 states and 172 transitions. [2025-03-08 09:46:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:46:19,542 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2025-03-08 09:46:19,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:46:19,546 INFO L225 Difference]: With dead ends: 102 [2025-03-08 09:46:19,547 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 09:46:19,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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 09:46:19,551 INFO L435 NwaCegarLoop]: 76 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, 76 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 09:46:19,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:46:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 09:46:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 09:46:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-08 09:46:19,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 76 transitions. [2025-03-08 09:46:19,587 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 76 transitions. Word has length 100 [2025-03-08 09:46:19,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:46:19,588 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 76 transitions. [2025-03-08 09:46:19,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-08 09:46:19,588 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 76 transitions. [2025-03-08 09:46:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 09:46:19,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:46:19,592 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:46:19,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 09:46:19,792 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 09:46:19,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:46:19,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:46:19,794 INFO L85 PathProgramCache]: Analyzing trace with hash -918809667, now seen corresponding path program 1 times [2025-03-08 09:46:19,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:46:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222185123] [2025-03-08 09:46:19,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:46:19,795 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 09:46:19,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:46:19,797 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 09:46:19,798 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 09:46:19,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 09:46:20,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 09:46:20,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:46:20,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:46:20,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 09:46:20,998 INFO L279 TraceCheckSpWp]: Computing forward predicates...