./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.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 88e82e90997623f17755cf4b0e74e4caa25dddf076fd59ee2ddcb63a8c826a1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:49:35,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:49:35,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:49:35,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:49:35,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:49:35,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:49:35,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:49:35,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:49:35,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:49:35,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:49:35,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:49:35,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:49:35,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:49:35,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:49:35,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:49:35,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:49:35,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:49:35,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:49:35,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:49:35,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:49:35,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:49:35,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:49:35,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:49:35,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:49:35,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:49:35,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:49:35,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:49:35,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:49:35,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:49:35,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:49:35,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:49:35,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:49:35,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:49:35,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:49:35,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:49:35,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:49:35,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:49:35,144 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 88e82e90997623f17755cf4b0e74e4caa25dddf076fd59ee2ddcb63a8c826a1e [2024-11-20 05:49:35,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:49:35,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:49:35,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:49:35,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:49:35,368 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:49:35,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:36,624 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:49:36,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:49:36,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:36,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a70af4f/7f139c3ded864ead8f10f5f881c7572b/FLAGc45a5a3e8 [2024-11-20 05:49:36,800 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10a70af4f/7f139c3ded864ead8f10f5f881c7572b [2024-11-20 05:49:36,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:49:36,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:49:36,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:36,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:49:36,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:49:36,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:36" (1/1) ... [2024-11-20 05:49:36,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151c7eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:36, skipping insertion in model container [2024-11-20 05:49:36,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:36" (1/1) ... [2024-11-20 05:49:36,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:49:36,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i[917,930] [2024-11-20 05:49:36,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:36,997 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:49:37,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i[917,930] [2024-11-20 05:49:37,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:37,040 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:49:37,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37 WrapperNode [2024-11-20 05:49:37,040 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:37,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:37,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:49:37,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:49:37,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,077 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 05:49:37,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:37,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:49:37,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:49:37,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:49:37,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,126 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]. [2024-11-20 05:49:37,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,136 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,141 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:49:37,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:49:37,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:49:37,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:49:37,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (1/1) ... [2024-11-20 05:49:37,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:49:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:49:37,207 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) [2024-11-20 05:49:37,221 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 [2024-11-20 05:49:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:49:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:49:37,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:49:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:49:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:49:37,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:49:37,326 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:49:37,328 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:49:37,547 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:49:37,547 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:49:37,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:49:37,561 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:49:37,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:37 BoogieIcfgContainer [2024-11-20 05:49:37,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:49:37,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:49:37,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:49:37,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:49:37,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:49:36" (1/3) ... [2024-11-20 05:49:37,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e736be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:37, skipping insertion in model container [2024-11-20 05:49:37,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:37" (2/3) ... [2024-11-20 05:49:37,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e736be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:37, skipping insertion in model container [2024-11-20 05:49:37,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:37" (3/3) ... [2024-11-20 05:49:37,571 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:37,584 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:49:37,584 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:49:37,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:49:37,647 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;@67503faf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:49:37,648 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:49:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 05:49:37,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 05:49:37,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:37,663 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:37,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 230850881, now seen corresponding path program 1 times [2024-11-20 05:49:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:49:37,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887891918] [2024-11-20 05:49:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:49:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:49:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 05:49:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 05:49:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:49:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:49:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 05:49:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 05:49:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-20 05:49:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 05:49:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 05:49:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 05:49:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 05:49:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 05:49:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 05:49:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 05:49:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-20 05:49:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 05:49:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-20 05:49:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 05:49:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:37,951 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-20 05:49:37,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:49:37,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887891918] [2024-11-20 05:49:37,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887891918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:49:37,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:49:37,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:49:37,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811308623] [2024-11-20 05:49:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:49:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:49:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:49:37,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:49:37,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:49:37,988 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 05:49:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:49:38,013 INFO L93 Difference]: Finished difference Result 107 states and 179 transitions. [2024-11-20 05:49:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:49:38,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-11-20 05:49:38,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:49:38,023 INFO L225 Difference]: With dead ends: 107 [2024-11-20 05:49:38,023 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 05:49:38,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:49:38,030 INFO L432 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 [2024-11-20 05:49:38,030 INFO L433 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] [2024-11-20 05:49:38,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 05:49:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 05:49:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 05:49:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-20 05:49:38,069 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 121 [2024-11-20 05:49:38,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:49:38,069 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-20 05:49:38,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 05:49:38,070 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-20 05:49:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 05:49:38,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:38,074 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:38,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:49:38,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:38,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:38,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1723829749, now seen corresponding path program 1 times [2024-11-20 05:49:38,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:49:38,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242181289] [2024-11-20 05:49:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:38,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:49:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:49:38,256 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:49:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:49:38,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:49:38,386 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:49:38,387 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:49:38,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:49:38,392 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-20 05:49:38,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:49:38,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:49:38 BoogieIcfgContainer [2024-11-20 05:49:38,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:49:38,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:49:38,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:49:38,468 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:49:38,468 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:37" (3/4) ... [2024-11-20 05:49:38,470 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:49:38,471 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:49:38,472 INFO L158 Benchmark]: Toolchain (without parser) took 1669.00ms. Allocated memory is still 203.4MB. Free memory was 137.2MB in the beginning and 89.8MB in the end (delta: 47.4MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,473 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:49:38,473 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.80ms. Allocated memory is still 203.4MB. Free memory was 137.0MB in the beginning and 122.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,474 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.88ms. Allocated memory is still 203.4MB. Free memory was 122.5MB in the beginning and 119.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,474 INFO L158 Benchmark]: Boogie Preprocessor took 68.24ms. Allocated memory is still 203.4MB. Free memory was 119.9MB in the beginning and 175.4MB in the end (delta: -55.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,476 INFO L158 Benchmark]: RCFGBuilder took 414.95ms. Allocated memory is still 203.4MB. Free memory was 175.4MB in the beginning and 159.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,477 INFO L158 Benchmark]: TraceAbstraction took 901.66ms. Allocated memory is still 203.4MB. Free memory was 158.6MB in the beginning and 90.6MB in the end (delta: 68.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-20 05:49:38,477 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 203.4MB. Free memory was 90.6MB in the beginning and 89.8MB in the end (delta: 871.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:49:38,479 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.40ms. Allocated memory is still 113.2MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.80ms. Allocated memory is still 203.4MB. Free memory was 137.0MB in the beginning and 122.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.88ms. Allocated memory is still 203.4MB. Free memory was 122.5MB in the beginning and 119.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.24ms. Allocated memory is still 203.4MB. Free memory was 119.9MB in the beginning and 175.4MB in the end (delta: -55.5MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 414.95ms. Allocated memory is still 203.4MB. Free memory was 175.4MB in the beginning and 159.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 901.66ms. Allocated memory is still 203.4MB. Free memory was 158.6MB in the beginning and 90.6MB in the end (delta: 68.0MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 203.4MB. Free memory was 90.6MB in the beginning and 89.8MB in the end (delta: 871.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 4.6; [L30] unsigned long int var_1_9 = 256; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 3724367395; [L33] unsigned long int var_1_12 = 25; [L34] unsigned long int var_1_13 = 1; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 100; VAL [isInitial=0, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L78] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L79] var_1_8 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L84] var_1_11 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_11 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L85] RET assume_abort_if_not(var_1_11 >= 3221225470) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L87] var_1_12 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L88] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L90] var_1_13 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L91] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L94] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L96] var_1_16 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L97] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L111] RET updateVariables() [L112] CALL step() [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L46] var_1_7 = ((15.5 + var_1_4) - (var_1_3 - var_1_8)) [L47] unsigned long int stepLocal_2 = var_1_13; [L48] signed long int stepLocal_1 = 5; VAL [isInitial=1, stepLocal_1=5, stepLocal_2=-2147483649, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L49] COND FALSE !(stepLocal_1 >= var_1_11) VAL [isInitial=1, stepLocal_2=-2147483649, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L60] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, stepLocal_2=-2147483649, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L61] COND TRUE var_1_10 || stepLocal_0 [L62] var_1_9 = ((var_1_11 - var_1_14) - var_1_14) VAL [isInitial=1, stepLocal_2=-2147483649, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_7 == ((double) ((15.5 + var_1_4) - (var_1_3 - var_1_8))))) && ((var_1_10 || var_1_2) ? (var_1_9 == ((unsigned long int) ((var_1_11 - var_1_14) - var_1_14))) : (var_1_9 == ((unsigned long int) (var_1_14 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))))) && ((5 >= var_1_11) ? ((var_1_1 >= var_1_8) ? (var_1_14 == ((unsigned char) (128 - 16))) : ((var_1_13 >= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) var_1_16)))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-2147483649, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 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, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred 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.2s InterpolantComputationTime, 242 NumberOfCodeBlocks, 242 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 120 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:49:38,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.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 88e82e90997623f17755cf4b0e74e4caa25dddf076fd59ee2ddcb63a8c826a1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:49:40,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:49:40,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:49:40,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:49:40,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:49:40,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:49:40,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:49:40,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:49:40,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:49:40,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:49:40,503 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:49:40,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:49:40,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:49:40,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:49:40,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:49:40,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:49:40,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:49:40,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:49:40,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:49:40,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:49:40,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:49:40,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:49:40,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:49:40,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:49:40,508 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:49:40,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:49:40,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:49:40,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:49:40,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:49:40,509 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:49:40,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:49:40,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:49:40,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:49:40,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:49:40,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:49:40,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:49:40,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:49:40,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:49:40,511 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:49:40,511 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:49:40,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:49:40,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:49:40,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:49:40,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:49:40,512 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 88e82e90997623f17755cf4b0e74e4caa25dddf076fd59ee2ddcb63a8c826a1e [2024-11-20 05:49:40,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:49:40,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:49:40,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:49:40,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:49:40,782 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:49:40,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:42,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:49:42,210 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:49:42,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:42,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6b5dd12/f8b993fa5b8b4bf7b0c862f67559b837/FLAGadf191382 [2024-11-20 05:49:42,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d6b5dd12/f8b993fa5b8b4bf7b0c862f67559b837 [2024-11-20 05:49:42,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:49:42,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:49:42,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:42,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:49:42,245 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:49:42,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a4c975a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42, skipping insertion in model container [2024-11-20 05:49:42,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:49:42,419 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i[917,930] [2024-11-20 05:49:42,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:42,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:49:42,496 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-20.i[917,930] [2024-11-20 05:49:42,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:49:42,545 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:49:42,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42 WrapperNode [2024-11-20 05:49:42,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:49:42,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:42,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:49:42,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:49:42,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,591 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-11-20 05:49:42,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:49:42,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:49:42,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:49:42,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:49:42,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,626 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]. [2024-11-20 05:49:42,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,636 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:49:42,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:49:42,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:49:42,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:49:42,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (1/1) ... [2024-11-20 05:49:42,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:49:42,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:49:42,675 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) [2024-11-20 05:49:42,678 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 [2024-11-20 05:49:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:49:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:49:42,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:49:42,713 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:49:42,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:49:42,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:49:42,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:49:42,774 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:49:50,641 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 05:49:50,641 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:49:50,655 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:49:50,655 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:49:50,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:50 BoogieIcfgContainer [2024-11-20 05:49:50,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:49:50,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:49:50,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:49:50,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:49:50,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:49:42" (1/3) ... [2024-11-20 05:49:50,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3b0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:50, skipping insertion in model container [2024-11-20 05:49:50,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:49:42" (2/3) ... [2024-11-20 05:49:50,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57f3b0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:49:50, skipping insertion in model container [2024-11-20 05:49:50,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:49:50" (3/3) ... [2024-11-20 05:49:50,664 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-20.i [2024-11-20 05:49:50,675 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:49:50,676 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:49:50,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:49:50,740 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;@2eb7c95a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:49:50,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:49:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 05:49:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 05:49:50,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:50,757 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:50,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:50,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:50,762 INFO L85 PathProgramCache]: Analyzing trace with hash 230850881, now seen corresponding path program 1 times [2024-11-20 05:49:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:49:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144590067] [2024-11-20 05:49:50,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:50,775 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 [2024-11-20 05:49:50,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:49:50,779 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) [2024-11-20 05:49:50,780 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 [2024-11-20 05:49:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:51,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:49:51,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:49:51,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-20 05:49:51,173 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:49:51,174 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:49:51,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144590067] [2024-11-20 05:49:51,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144590067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:49:51,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:49:51,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:49:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67839033] [2024-11-20 05:49:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:49:51,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:49:51,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:49:51,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:49:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:49:51,209 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 05:49:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:49:51,234 INFO L93 Difference]: Finished difference Result 107 states and 179 transitions. [2024-11-20 05:49:51,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:49:51,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2024-11-20 05:49:51,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:49:51,241 INFO L225 Difference]: With dead ends: 107 [2024-11-20 05:49:51,241 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 05:49:51,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:49:51,245 INFO L432 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 [2024-11-20 05:49:51,246 INFO L433 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] [2024-11-20 05:49:51,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 05:49:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 05:49:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-20 05:49:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2024-11-20 05:49:51,274 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 121 [2024-11-20 05:49:51,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:49:51,274 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2024-11-20 05:49:51,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-20 05:49:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2024-11-20 05:49:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 05:49:51,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:49:51,277 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:49:51,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 05:49:51,478 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 [2024-11-20 05:49:51,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:49:51,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:49:51,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1723829749, now seen corresponding path program 1 times [2024-11-20 05:49:51,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:49:51,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034198425] [2024-11-20 05:49:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:49:51,480 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 [2024-11-20 05:49:51,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:49:51,502 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) [2024-11-20 05:49:51,503 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 [2024-11-20 05:49:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:49:51,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 05:49:51,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:50:23,403 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:50:31,536 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:50:38,558 WARN L286 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:50:46,680 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:50:54,810 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:51:02,942 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:51:10,936 WARN L286 SmtUtils]: Spent 7.99s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 05:51:18,869 WARN L286 SmtUtils]: Spent 7.93s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)