./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_loopvsstraightlinecode_25-while_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_loopvsstraightlinecode_25-while_file-11.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 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:15:18,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:15:18,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:15:18,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:15:18,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:15:18,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:15:18,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:15:18,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:15:18,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:15:18,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:15:18,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:15:18,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:15:18,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:15:18,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:15:18,920 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:15:18,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:15:18,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:15:18,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:15:18,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:15:18,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:15:18,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:15:18,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:15:18,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:15:18,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:15:18,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:15:18,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:15:18,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:15:18,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:15:18,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:15:18,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:15:18,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:15:18,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:15:18,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:18,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:15:18,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:15:18,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:15:18,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:15:18,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:15:18,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:15:18,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:15:18,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:15:18,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:15:18,931 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 -> 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 [2024-10-13 04:15:19,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:15:19,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:15:19,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:15:19,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:15:19,209 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:15:19,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:20,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:15:20,929 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:15:20,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:20,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf1a4b8b/249ff5ca163e4745bc737398565e38ca/FLAGb60091ad6 [2024-10-13 04:15:21,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf1a4b8b/249ff5ca163e4745bc737398565e38ca [2024-10-13 04:15:21,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:15:21,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:15:21,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:21,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:15:21,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:15:21,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5df871fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21, skipping insertion in model container [2024-10-13 04:15:21,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:15:21,475 WARN L248 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_loopvsstraightlinecode_25-while_file-11.i[915,928] [2024-10-13 04:15:21,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:21,546 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:15:21,560 WARN L248 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_loopvsstraightlinecode_25-while_file-11.i[915,928] [2024-10-13 04:15:21,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:21,609 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:15:21,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21 WrapperNode [2024-10-13 04:15:21,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:21,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:21,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:15:21,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:15:21,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,648 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-10-13 04:15:21,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:21,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:15:21,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:15:21,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:15:21,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,663 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,673 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-10-13 04:15:21,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:15:21,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:15:21,691 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:15:21,691 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:15:21,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (1/1) ... [2024-10-13 04:15:21,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:21,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:15:21,725 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-10-13 04:15:21,737 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-10-13 04:15:21,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:15:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:15:21,782 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:15:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:15:21,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:15:21,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:15:21,852 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:15:21,854 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:15:22,137 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:15:22,137 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:15:22,191 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:15:22,192 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:15:22,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:22 BoogieIcfgContainer [2024-10-13 04:15:22,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:15:22,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:15:22,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:15:22,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:15:22,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:15:21" (1/3) ... [2024-10-13 04:15:22,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f90ab57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:22, skipping insertion in model container [2024-10-13 04:15:22,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:21" (2/3) ... [2024-10-13 04:15:22,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f90ab57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:22, skipping insertion in model container [2024-10-13 04:15:22,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:22" (3/3) ... [2024-10-13 04:15:22,204 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:22,221 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:15:22,221 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:15:22,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:15:22,292 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;@6166ae07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:15:22,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:15:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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-10-13 04:15:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:15:22,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:22,307 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] [2024-10-13 04:15:22,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:22,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:22,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1748622799, now seen corresponding path program 1 times [2024-10-13 04:15:22,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:15:22,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228128252] [2024-10-13 04:15:22,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:15:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:15:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:15:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:15:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:15:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:15:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 04:15:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:15:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 04:15:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 04:15:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 04:15:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 04:15:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:15:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:15:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 04:15:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 04:15:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 04:15:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 04:15:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 04:15:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 04:15:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 04:15:22,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:15:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228128252] [2024-10-13 04:15:22,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228128252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:15:22,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:15:22,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:15:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740868477] [2024-10-13 04:15:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:15:22,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:15:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:15:22,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:15:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:15:22,716 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-13 04:15:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:15:22,771 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-13 04:15:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:15:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 115 [2024-10-13 04:15:22,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:15:22,784 INFO L225 Difference]: With dead ends: 99 [2024-10-13 04:15:22,784 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 04:15:22,787 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-10-13 04:15:22,791 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:15:22,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:15:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 04:15:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 04:15:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 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-10-13 04:15:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 74 transitions. [2024-10-13 04:15:22,875 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 74 transitions. Word has length 115 [2024-10-13 04:15:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:15:22,875 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 74 transitions. [2024-10-13 04:15:22,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-10-13 04:15:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 74 transitions. [2024-10-13 04:15:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:15:22,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:22,884 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] [2024-10-13 04:15:22,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:15:22,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:22,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:22,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1149944329, now seen corresponding path program 1 times [2024-10-13 04:15:22,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:15:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589171936] [2024-10-13 04:15:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:15:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:15:23,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [176652528] [2024-10-13 04:15:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:15:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:15:23,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:15:23,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 04:15:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:15:23,286 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:15:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:15:23,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:15:23,396 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:15:23,400 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:15:23,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 04:15:23,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:15:23,608 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:15:23,698 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:15:23,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:15:23 BoogieIcfgContainer [2024-10-13 04:15:23,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:15:23,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:15:23,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:15:23,704 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:15:23,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:22" (3/4) ... [2024-10-13 04:15:23,707 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:15:23,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:15:23,709 INFO L158 Benchmark]: Toolchain (without parser) took 2418.80ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 76.4MB in the beginning and 122.3MB in the end (delta: -45.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:23,709 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:23,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.42ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 76.2MB in the beginning and 160.9MB in the end (delta: -84.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-10-13 04:15:23,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.80ms. Allocated memory is still 188.7MB. Free memory was 160.9MB in the beginning and 158.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:15:23,713 INFO L158 Benchmark]: Boogie Preprocessor took 40.54ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 155.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:15:23,713 INFO L158 Benchmark]: RCFGBuilder took 501.40ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 136.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 04:15:23,713 INFO L158 Benchmark]: TraceAbstraction took 1505.70ms. Allocated memory is still 188.7MB. Free memory was 136.8MB in the beginning and 122.3MB in the end (delta: 14.5MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-10-13 04:15:23,714 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 188.7MB. Free memory is still 122.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:15:23,717 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.18ms. Allocated memory is still 151.0MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.42ms. Allocated memory was 151.0MB in the beginning and 188.7MB in the end (delta: 37.7MB). Free memory was 76.2MB in the beginning and 160.9MB in the end (delta: -84.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.80ms. Allocated memory is still 188.7MB. Free memory was 160.9MB in the beginning and 158.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.54ms. Allocated memory is still 188.7MB. Free memory was 158.8MB in the beginning and 155.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 501.40ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 136.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1505.70ms. Allocated memory is still 188.7MB. Free memory was 136.8MB in the beginning and 122.3MB in the end (delta: 14.5MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 188.7MB. Free memory is still 122.3MB. 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 someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] double var_1_2 = 50.75; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 0; [L26] signed char var_1_7 = 10; [L27] float var_1_8 = 32.5; [L28] float var_1_9 = 1000000.7; [L29] float var_1_10 = 1.2; [L30] unsigned short int var_1_11 = 256; [L31] signed long int var_1_12 = -64; [L32] signed long int var_1_13 = -16; [L33] unsigned short int var_1_14 = 56281; [L34] unsigned short int var_1_15 = 32; [L35] float last_1_var_1_8 = 32.5; [L102] isInitial = 1 [L103] FCALL initially() [L104] COND TRUE 1 [L105] CALL updateLastVariables() [L95] last_1_var_1_8 = var_1_8 [L105] RET updateLastVariables() [L106] CALL updateVariables() [L64] var_1_2 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L65] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L67] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=0, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=10, var_1_8=65/2, var_1_9=10000007/10] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2, var_1_9=10000007/10] [L75] var_1_9 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L76] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_10=6/5, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L77] var_1_10 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L78] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=-64, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L79] var_1_12 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L80] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L81] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L81] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L82] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L82] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=-16, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L83] var_1_13 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L84] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L85] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L85] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L86] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L86] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=56281, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L87] var_1_14 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L88] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L89] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L89] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=32, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L90] var_1_15 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L91] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L92] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L92] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L106] RET updateVariables() [L107] CALL step() [L39] COND FALSE !(last_1_var_1_8 >= var_1_2) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L48] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L49] COND FALSE !((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L58] signed long int stepLocal_1 = var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))); VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, stepLocal_1=-8, var_1_11=256, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L59] COND TRUE stepLocal_1 < var_1_7 [L60] var_1_11 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_8=65/2, stepLocal_0=1, var_1_11=32767, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L107] RET step() [L108] CALL, EXPR property() [L98-L99] return ((((var_1_2 - 5.25) < (var_1_8 * (var_1_8 * 199.4))) ? ((var_1_5 && var_1_6) ? ((var_1_8 < var_1_8) ? (var_1_1 == ((signed char) var_1_7)) : (var_1_1 == ((signed char) var_1_7))) : 1) : 1) && ((last_1_var_1_8 >= var_1_2) ? (var_1_6 ? ((! var_1_5) ? (var_1_8 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : (var_1_8 == ((float) var_1_9))) : 1) : 1)) && (((var_1_1 / ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13)))) < var_1_7) ? (var_1_11 == ((unsigned short int) (var_1_14 - var_1_15))) : 1) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=65/2, var_1_11=32767, var_1_12=2, var_1_13=3, var_1_14=32767, var_1_15=0, var_1_1=-16, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=65/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, 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, 71 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 71 mSDtfsCounter, 3 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=51occurred 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.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 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-10-13 04:15:23,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_loopvsstraightlinecode_25-while_file-11.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 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:15:26,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:15:26,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:15:26,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:15:26,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:15:26,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:15:26,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:15:26,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:15:26,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:15:26,178 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:15:26,178 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:15:26,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:15:26,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:15:26,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:15:26,182 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:15:26,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:15:26,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:15:26,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:15:26,186 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:15:26,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:15:26,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:15:26,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:15:26,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:15:26,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:15:26,188 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:15:26,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:15:26,189 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:15:26,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:15:26,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:15:26,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:15:26,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:15:26,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:15:26,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:15:26,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:15:26,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:26,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:15:26,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:15:26,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:15:26,192 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:15:26,192 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:15:26,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:15:26,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:15:26,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:15:26,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:15:26,194 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:15:26,195 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 -> 471646664bde209a2d055afa13c4b9792441594ee5a58aa96bbccbdd9caad8c6 [2024-10-13 04:15:26,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:15:26,543 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:15:26,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:15:26,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:15:26,548 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:15:26,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:28,124 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:15:28,335 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:15:28,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:28,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988690712/c7b2553780684b16a1913752f82d3b37/FLAG4bdadf373 [2024-10-13 04:15:28,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988690712/c7b2553780684b16a1913752f82d3b37 [2024-10-13 04:15:28,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:15:28,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:15:28,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:28,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:15:28,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:15:28,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448ad4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28, skipping insertion in model container [2024-10-13 04:15:28,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:15:28,570 WARN L248 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_loopvsstraightlinecode_25-while_file-11.i[915,928] [2024-10-13 04:15:28,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:28,642 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:15:28,656 WARN L248 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_loopvsstraightlinecode_25-while_file-11.i[915,928] [2024-10-13 04:15:28,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:15:28,708 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:15:28,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28 WrapperNode [2024-10-13 04:15:28,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:15:28,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:28,710 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:15:28,710 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:15:28,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,762 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-13 04:15:28,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:15:28,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:15:28,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:15:28,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:15:28,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,803 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-10-13 04:15:28,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:15:28,839 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:15:28,839 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:15:28,839 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:15:28,840 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (1/1) ... [2024-10-13 04:15:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:15:28,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:15:28,892 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-10-13 04:15:28,898 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-10-13 04:15:28,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:15:28,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:15:28,950 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:15:28,950 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:15:28,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:15:28,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:15:29,029 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:15:29,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:15:41,751 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 04:15:41,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:15:41,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:15:41,791 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:15:41,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:41 BoogieIcfgContainer [2024-10-13 04:15:41,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:15:41,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:15:41,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:15:41,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:15:41,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:15:28" (1/3) ... [2024-10-13 04:15:41,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f62ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:41, skipping insertion in model container [2024-10-13 04:15:41,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:15:28" (2/3) ... [2024-10-13 04:15:41,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f62ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:15:41, skipping insertion in model container [2024-10-13 04:15:41,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:15:41" (3/3) ... [2024-10-13 04:15:41,821 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-11.i [2024-10-13 04:15:41,837 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:15:41,837 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:15:41,903 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:15:41,910 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;@175222ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:15:41,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:15:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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-10-13 04:15:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:15:41,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:41,930 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] [2024-10-13 04:15:41,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:41,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:41,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1748622799, now seen corresponding path program 1 times [2024-10-13 04:15:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:15:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148928726] [2024-10-13 04:15:41,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:41,953 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-10-13 04:15:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:15:41,956 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-10-13 04:15:41,958 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-10-13 04:15:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:42,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:15:42,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:15:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2024-10-13 04:15:42,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:15:42,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:15:42,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148928726] [2024-10-13 04:15:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148928726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:15:42,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:15:42,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:15:42,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490056176] [2024-10-13 04:15:42,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:15:42,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:15:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:15:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:15:42,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:15:42,606 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 30 states have internal predecessors, (41), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 04:15:46,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:15:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:15:46,844 INFO L93 Difference]: Finished difference Result 99 states and 175 transitions. [2024-10-13 04:15:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:15:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 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 115 [2024-10-13 04:15:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:15:46,914 INFO L225 Difference]: With dead ends: 99 [2024-10-13 04:15:46,914 INFO L226 Difference]: Without dead ends: 49 [2024-10-13 04:15:46,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-10-13 04:15:46,919 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:15:46,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 04:15:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-13 04:15:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-13 04:15:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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-10-13 04:15:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions. [2024-10-13 04:15:46,962 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 115 [2024-10-13 04:15:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:15:46,963 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 73 transitions. [2024-10-13 04:15:46,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 04:15:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions. [2024-10-13 04:15:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 04:15:46,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:15:46,966 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] [2024-10-13 04:15:46,984 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-10-13 04:15:47,167 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-10-13 04:15:47,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:15:47,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:15:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1149944329, now seen corresponding path program 1 times [2024-10-13 04:15:47,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:15:47,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480449243] [2024-10-13 04:15:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:15:47,170 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-10-13 04:15:47,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:15:47,172 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-10-13 04:15:47,195 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-10-13 04:15:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:15:47,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 04:15:47,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:15:56,361 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:16:04,593 WARN L286 SmtUtils]: Spent 8.23s 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-10-13 04:16:08,666 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2024-10-13 04:16:12,730 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true [2024-10-13 04:16:20,887 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:16:29,103 WARN L286 SmtUtils]: Spent 8.21s 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-10-13 04:16:37,249 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:16:45,467 WARN L286 SmtUtils]: Spent 8.22s 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-10-13 04:16:53,714 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 04:16:57,789 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from false [2024-10-13 04:17:01,858 WARN L873 $PredicateComparison]: unable to prove that (and (= ((_ extract 15 0) (bvadd (bvneg ((_ zero_extend 16) c_~var_1_15~0)) ((_ zero_extend 16) c_~var_1_14~0))) c_~var_1_11~0) (not (fp.lt (fp.sub c_currentRoundingMode c_~var_1_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_8~0))) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (not (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_~last_1_var_1_8~0) c_~var_1_2~0))) is different from true