./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.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_floatingpointinfluence_no-floats_file-93_fixed.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 ddec760117dfe95addb3119868a1a4b9235e79a721f69484238bafe264cc3b9f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:41:49,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:41:49,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:41:49,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:41:49,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:41:49,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:41:49,334 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:41:49,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:41:49,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:41:49,335 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:41:49,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:41:49,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:41:49,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:41:49,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:41:49,342 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:41:49,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:41:49,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:41:49,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:41:49,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:41:49,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:41:49,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:41:49,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:41:49,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:41:49,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:41:49,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:41:49,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:41:49,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:41:49,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:41:49,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:41:49,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:41:49,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:41:49,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:41:49,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:49,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:41:49,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:41:49,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:41:49,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:41:49,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:41:49,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:41:49,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:41:49,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:41:49,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:41:49,372 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 -> ddec760117dfe95addb3119868a1a4b9235e79a721f69484238bafe264cc3b9f [2024-10-13 03:41:49,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:41:49,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:41:49,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:41:49,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:41:49,680 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:41:49,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:41:51,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:41:51,261 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:41:51,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:41:51,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4c07f01/355e7368b3ba4251bb7b17249b6eec4a/FLAGb3ac0bc8a [2024-10-13 03:41:51,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb4c07f01/355e7368b3ba4251bb7b17249b6eec4a [2024-10-13 03:41:51,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:41:51,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:41:51,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:51,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:41:51,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:41:51,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb83a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51, skipping insertion in model container [2024-10-13 03:41:51,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:41:51,470 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_floatingpointinfluence_no-floats_file-93_fixed.i[916,929] [2024-10-13 03:41:51,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:51,515 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:41:51,526 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_floatingpointinfluence_no-floats_file-93_fixed.i[916,929] [2024-10-13 03:41:51,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:51,563 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:41:51,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51 WrapperNode [2024-10-13 03:41:51,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:51,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:51,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:41:51,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:41:51,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,630 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-10-13 03:41:51,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:51,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:41:51,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:41:51,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:41:51,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,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 03:41:51,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,698 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:41:51,699 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:41:51,699 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:41:51,700 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:41:51,700 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (1/1) ... [2024-10-13 03:41:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:51,732 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 03:41:51,734 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 03:41:51,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:41:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:41:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:41:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:41:51,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:41:51,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:41:51,830 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:41:51,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:41:52,094 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 03:41:52,094 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:41:52,158 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:41:52,158 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:41:52,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:52 BoogieIcfgContainer [2024-10-13 03:41:52,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:41:52,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:41:52,162 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:41:52,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:41:52,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:41:51" (1/3) ... [2024-10-13 03:41:52,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27629556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:52, skipping insertion in model container [2024-10-13 03:41:52,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:51" (2/3) ... [2024-10-13 03:41:52,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27629556 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:41:52, skipping insertion in model container [2024-10-13 03:41:52,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:52" (3/3) ... [2024-10-13 03:41:52,169 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:41:52,184 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:41:52,185 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:41:52,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:41:52,257 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;@7b6191c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:41:52,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:41:52,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 03:41:52,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:52,272 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:52,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:52,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash 671086619, now seen corresponding path program 1 times [2024-10-13 03:41:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771234016] [2024-10-13 03:41:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:41:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:41:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 03:41:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:41:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 03:41:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-13 03:41:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:41:52,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-13 03:41:52,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:41:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 03:41:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:41:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-13 03:41:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:41:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-13 03:41:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:41:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 03:41:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:41:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-13 03:41:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:41:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:41:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:41:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 03:41:52,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:41:52,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771234016] [2024-10-13 03:41:52,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771234016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:41:52,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:41:52,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:41:52,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771771375] [2024-10-13 03:41:52,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:41:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:41:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:41:52,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:41:52,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:41:52,653 INFO L87 Difference]: Start difference. First operand has 47 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:41:52,708 INFO L93 Difference]: Finished difference Result 91 states and 166 transitions. [2024-10-13 03:41:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:41:52,711 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 117 [2024-10-13 03:41:52,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:41:52,719 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:41:52,719 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 03:41:52,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 03:41:52,728 INFO L432 NwaCegarLoop]: 66 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, 66 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 03:41:52,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:41:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 03:41:52,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 03:41:52,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:41:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2024-10-13 03:41:52,781 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 117 [2024-10-13 03:41:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:41:52,783 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 69 transitions. [2024-10-13 03:41:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 03:41:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-10-13 03:41:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 03:41:52,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:41:52,788 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:41:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:41:52,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:41:52,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:41:52,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1310300833, now seen corresponding path program 1 times [2024-10-13 03:41:52,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:41:52,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019743414] [2024-10-13 03:41:52,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:41:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 03:41:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475148504] [2024-10-13 03:41:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:41:52,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:41:52,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:52,974 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 03:41:52,976 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 03:41:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:41:53,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:41:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:41:53,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 03:41:53,252 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 03:41:53,253 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 03:41:53,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 03:41:53,456 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 03:41:53,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 03:41:53,547 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 03:41:53,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 03:41:53 BoogieIcfgContainer [2024-10-13 03:41:53,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 03:41:53,555 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 03:41:53,555 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 03:41:53,555 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 03:41:53,556 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:41:52" (3/4) ... [2024-10-13 03:41:53,558 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 03:41:53,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 03:41:53,561 INFO L158 Benchmark]: Toolchain (without parser) took 2274.50ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 122.9MB in the beginning and 148.3MB in the end (delta: -25.4MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,562 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 123.7MB in the beginning and 123.7MB in the end (delta: 22.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:41:53,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.03ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 109.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.71ms. Allocated memory is still 153.1MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,565 INFO L158 Benchmark]: Boogie Preprocessor took 63.65ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,565 INFO L158 Benchmark]: RCFGBuilder took 459.20ms. Allocated memory is still 153.1MB. Free memory was 104.2MB in the beginning and 114.0MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,566 INFO L158 Benchmark]: TraceAbstraction took 1389.62ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 113.1MB in the beginning and 148.3MB in the end (delta: -35.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-13 03:41:53,566 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 199.2MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 03:41:53,568 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.17ms. Allocated memory is still 153.1MB. Free memory was 123.7MB in the beginning and 123.7MB in the end (delta: 22.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.03ms. Allocated memory is still 153.1MB. Free memory was 122.3MB in the beginning and 109.1MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.71ms. Allocated memory is still 153.1MB. Free memory was 109.1MB in the beginning and 106.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.65ms. Allocated memory is still 153.1MB. Free memory was 106.9MB in the beginning and 104.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.20ms. Allocated memory is still 153.1MB. Free memory was 104.2MB in the beginning and 114.0MB in the end (delta: -9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1389.62ms. Allocated memory was 153.1MB in the beginning and 199.2MB in the end (delta: 46.1MB). Free memory was 113.1MB in the beginning and 148.3MB in the end (delta: -35.3MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 199.2MB. Free memory is still 148.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 to_int at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 255; [L23] signed long int var_1_3 = 0; [L24] signed long int var_1_5 = 128; [L25] signed long int var_1_6 = 9; [L26] signed long int var_1_7 = 31; [L27] signed long int var_1_8 = 9; [L28] signed long int var_1_9 = 499; [L29] signed long int var_1_10 = 1; [L30] unsigned char var_1_11 = 0; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] signed long int last_1_var_1_10 = 1; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_10 = var_1_10 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_long() [L62] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L62] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L63] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L64] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=128, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L65] var_1_5 = __VERIFIER_nondet_long() [L66] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L66] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L67] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L68] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=9, var_1_7=31, var_1_8=9, var_1_9=499] [L69] var_1_6 = __VERIFIER_nondet_long() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L71] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=31, var_1_8=9, var_1_9=499] [L72] var_1_7 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L74] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L74] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=9, var_1_9=499] [L75] var_1_8 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L77] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L77] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=499] [L78] var_1_9 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L79] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L80] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L80] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=1, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L81] var_1_12 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L82] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L83] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L83] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L84] var_1_13 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L85] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L86] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L86] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L87] var_1_14 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L88] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L89] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L89] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=255, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L103] RET updateVariables() [L104] CALL step() [L38] COND FALSE !(((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) [L45] var_1_1 = 64.51f VAL [isInitial=1, last_1_var_1_10=1, var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L47] COND TRUE var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1)))) [L48] var_1_10 = 2147000000.0f VAL [isInitial=1, last_1_var_1_10=1, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L52] COND TRUE ! (var_1_3 <= var_1_10) [L53] var_1_11 = (var_1_12 && var_1_13) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L104] RET step() [L105] CALL, EXPR property() [L95-L96] return (((((- last_1_var_1_10) / var_1_3) != (last_1_var_1_10 / var_1_5)) ? ((last_1_var_1_10 != (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - var_1_8)) ? (var_1_1 == ((signed long int) var_1_9)) : (var_1_1 == ((signed long int) var_1_9))) : (var_1_1 == ((signed long int) 64.51f))) && ((var_1_1 > (((((var_1_9 * 128.4)) > ((var_1_5 * var_1_1))) ? ((var_1_9 * 128.4)) : ((var_1_5 * var_1_1))))) ? (var_1_10 == ((signed long int) 2147000000.0f)) : (var_1_10 == ((signed long int) var_1_9)))) && ((! (var_1_3 <= var_1_10)) ? (var_1_11 == ((unsigned char) (var_1_12 && var_1_13))) : (((var_1_7 / var_1_3) < ((((((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) < (var_1_5)) ? (((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6)))) : (var_1_5)))) ? (var_1_11 == ((unsigned char) var_1_14)) : 1)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=0, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=1, var_1_10=0, var_1_11=0, var_1_12=-255, var_1_13=0, var_1_14=1, var_1_1=0, var_1_3=2, var_1_5=3, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 20, 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, 66 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, 66 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 351 NumberOfCodeBlocks, 351 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 760/760 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 03:41:53,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.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 ddec760117dfe95addb3119868a1a4b9235e79a721f69484238bafe264cc3b9f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:41:55,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:41:55,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 03:41:55,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:41:55,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:41:55,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:41:55,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:41:55,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:41:55,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:41:55,865 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:41:55,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:41:55,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:41:55,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:41:55,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:41:55,869 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:41:55,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:41:55,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:41:55,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:41:55,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:41:55,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:41:55,870 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:41:55,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:41:55,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:41:55,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:41:55,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:41:55,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:41:55,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:41:55,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:41:55,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:41:55,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:55,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:41:55,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:41:55,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:41:55,888 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 03:41:55,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 03:41:55,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:41:55,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:41:55,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:41:55,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:41:55,890 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 03:41:55,890 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 -> ddec760117dfe95addb3119868a1a4b9235e79a721f69484238bafe264cc3b9f [2024-10-13 03:41:56,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:41:56,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:41:56,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:41:56,229 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:41:56,230 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:41:56,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:41:57,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:41:57,968 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:41:57,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:41:57,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6960bef/a25baa2ad13f4424952a13c949b88c22/FLAG349fee807 [2024-10-13 03:41:58,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d6960bef/a25baa2ad13f4424952a13c949b88c22 [2024-10-13 03:41:58,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:41:58,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:41:58,336 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:58,336 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:41:58,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:41:58,341 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62706996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58, skipping insertion in model container [2024-10-13 03:41:58,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:41:58,557 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_floatingpointinfluence_no-floats_file-93_fixed.i[916,929] [2024-10-13 03:41:58,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:58,638 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:41:58,651 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_floatingpointinfluence_no-floats_file-93_fixed.i[916,929] [2024-10-13 03:41:58,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:41:58,702 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:41:58,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58 WrapperNode [2024-10-13 03:41:58,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:41:58,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:58,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:41:58,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:41:58,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,758 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 03:41:58,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:41:58,763 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:41:58,763 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:41:58,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:41:58,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,799 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 03:41:58,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,807 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,821 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:41:58,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:41:58,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:41:58,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:41:58,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (1/1) ... [2024-10-13 03:41:58,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:41:58,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:41:58,865 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 03:41:58,868 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 03:41:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:41:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 03:41:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:41:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:41:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:41:58,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:41:59,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:41:59,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:42:11,616 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 03:42:11,617 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:42:11,686 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:42:11,686 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:42:11,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:42:11 BoogieIcfgContainer [2024-10-13 03:42:11,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:42:11,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:42:11,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:42:11,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:42:11,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:41:58" (1/3) ... [2024-10-13 03:42:11,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1462dd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:42:11, skipping insertion in model container [2024-10-13 03:42:11,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:41:58" (2/3) ... [2024-10-13 03:42:11,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1462dd4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:42:11, skipping insertion in model container [2024-10-13 03:42:11,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:42:11" (3/3) ... [2024-10-13 03:42:11,700 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-93_fixed.i [2024-10-13 03:42:11,717 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:42:11,717 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:42:11,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:42:11,790 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;@5a5400e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:42:11,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:42:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:42:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 03:42:11,807 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:11,808 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:42:11,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:11,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:11,814 INFO L85 PathProgramCache]: Analyzing trace with hash 671086619, now seen corresponding path program 1 times [2024-10-13 03:42:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:42:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699785930] [2024-10-13 03:42:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:11,829 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 03:42:11,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:42:11,833 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 03:42:11,834 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 03:42:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:12,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 03:42:12,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:42:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-10-13 03:42:12,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 03:42:12,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 03:42:12,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699785930] [2024-10-13 03:42:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699785930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:42:12,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:42:12,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:42:12,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234895091] [2024-10-13 03:42:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:42:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:42:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 03:42:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:42:12,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:42:12,302 INFO L87 Difference]: Start difference. First operand has 47 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:16,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 03:42:16,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:42:16,565 INFO L93 Difference]: Finished difference Result 91 states and 166 transitions. [2024-10-13 03:42:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:42:16,638 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) Word has length 117 [2024-10-13 03:42:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:42:16,644 INFO L225 Difference]: With dead ends: 91 [2024-10-13 03:42:16,644 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 03:42:16,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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 03:42:16,650 INFO L432 NwaCegarLoop]: 66 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, 66 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 03:42:16,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 03:42:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 03:42:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 03:42:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 03:42:16,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2024-10-13 03:42:16,696 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 69 transitions. Word has length 117 [2024-10-13 03:42:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:42:16,696 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 69 transitions. [2024-10-13 03:42:16,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 03:42:16,697 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 69 transitions. [2024-10-13 03:42:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 03:42:16,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:42:16,703 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:42:16,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 03:42:16,903 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 03:42:16,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:42:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:42:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1310300833, now seen corresponding path program 1 times [2024-10-13 03:42:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 03:42:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485528946] [2024-10-13 03:42:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:16,906 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 03:42:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 03:42:16,912 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 03:42:16,913 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 03:42:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:42:17,361 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 03:42:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 03:42:17,718 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-10-13 03:42:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1774727076] [2024-10-13 03:42:17,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:42:17,719 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 03:42:17,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 03:42:17,722 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 03:42:17,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-13 03:42:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:42:18,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 03:42:18,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 03:42:28,061 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:42:34,914 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:42:43,144 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:42:49,676 WARN L286 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:42:57,907 WARN L286 SmtUtils]: Spent 8.23s 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 03:43:04,437 WARN L286 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:43:17,478 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-13 03:43:21,546 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0)))) (= c_~var_1_10~0 ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 8 24) c_currentRoundingMode 2147000000.0))) (= (bvsdiv (bvneg c_~last_1_var_1_10~0) c_~var_1_3~0) (bvsdiv c_~last_1_var_1_10~0 c_~var_1_5~0)) (bvsle ((_ zero_extend 24) c_~var_1_13~0) (_ bv0 32)) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_9~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 642.0 5.0)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_1~0))) (or (and .cse0 (fp.gt .cse1 .cse2)) (and (not .cse0) (fp.gt .cse1 .cse3)))))) is different from false [2024-10-13 03:43:25,626 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_1~0 ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 8 24) c_currentRoundingMode (/ 6451.0 100.0)))) (= c_~var_1_10~0 ((_ fp.to_sbv 32) roundTowardZero ((_ to_fp 8 24) c_currentRoundingMode 2147000000.0))) (= (bvsdiv (bvneg c_~last_1_var_1_10~0) c_~var_1_3~0) (bvsdiv c_~last_1_var_1_10~0 c_~var_1_5~0)) (bvsle ((_ zero_extend 24) c_~var_1_13~0) (_ bv0 32)) (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_9~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 642.0 5.0)))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_~var_1_5~0 c_~var_1_1~0)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_1~0))) (or (and .cse0 (fp.gt .cse1 .cse2)) (and (not .cse0) (fp.gt .cse1 .cse3)))))) is different from true