./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c -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.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a ................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c -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.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 788527977e7ebd7aa0a832758f41b65d3cbd270a ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:54:22,309 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:54:22,313 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:54:22,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:54:22,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:54:22,331 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:54:22,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:54:22,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:54:22,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:54:22,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:54:22,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:54:22,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:54:22,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:54:22,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:54:22,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:54:22,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:54:22,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:54:22,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:54:22,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:54:22,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:54:22,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:54:22,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:54:22,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:54:22,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:54:22,358 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:54:22,359 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:54:22,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:54:22,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:54:22,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:54:22,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:54:22,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:54:22,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:54:22,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:54:22,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:54:22,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:54:22,366 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:54:22,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:54:22,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:54:22,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:54:22,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:54:22,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:54:22,385 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:54:22,385 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:54:22,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:54:22,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:54:22,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:54:22,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:54:22,387 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:54:22,387 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:54:22,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:54:22,387 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:54:22,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:54:22,388 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:54:22,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:22,388 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:54:22,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:54:22,388 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:54:22,388 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:54:22,389 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:54:22,389 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:54:22,389 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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.graphml 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(__VERIFIER_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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2018-12-31 03:54:22,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:54:22,459 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:54:22,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:54:22,465 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:54:22,465 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:54:22,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:22,527 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27d38fcb/f6c06ea4dcdd4d62a85567531e17668b/FLAG3099d281a [2018-12-31 03:54:23,005 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:54:23,006 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:23,014 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27d38fcb/f6c06ea4dcdd4d62a85567531e17668b/FLAG3099d281a [2018-12-31 03:54:23,336 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a27d38fcb/f6c06ea4dcdd4d62a85567531e17668b [2018-12-31 03:54:23,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:54:23,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:54:23,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:23,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:54:23,346 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:54:23,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c1e892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23, skipping insertion in model container [2018-12-31 03:54:23,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:54:23,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:54:23,718 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:23,723 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:54:23,777 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:23,805 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:54:23,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23 WrapperNode [2018-12-31 03:54:23,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:23,807 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:23,807 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:54:23,808 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:54:23,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,834 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:23,951 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:54:23,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:54:23,951 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:54:23,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:23,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... [2018-12-31 03:54:24,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:54:24,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:54:24,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:54:24,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:54:24,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:54:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:54:24,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:54:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:54:24,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:54:24,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:54:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:54:24,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:54:24,846 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:54:24,846 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:54:24,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:24 BoogieIcfgContainer [2018-12-31 03:54:24,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:54:24,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:54:24,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:54:24,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:54:24,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:54:23" (1/3) ... [2018-12-31 03:54:24,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:24, skipping insertion in model container [2018-12-31 03:54:24,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:23" (2/3) ... [2018-12-31 03:54:24,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:24, skipping insertion in model container [2018-12-31 03:54:24,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:24" (3/3) ... [2018-12-31 03:54:24,857 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:24,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:54:24,876 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:54:24,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:54:24,932 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:54:24,933 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:54:24,933 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:54:24,933 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:54:24,934 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:54:24,934 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:54:24,934 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:54:24,935 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:54:24,935 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:54:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-31 03:54:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-31 03:54:24,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:24,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:24,965 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 361085180, now seen corresponding path program 1 times [2018-12-31 03:54:24,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:54:24,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:54:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:25,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:25,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:25,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:54:25,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:54:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:54:25,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:54:25,106 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-12-31 03:54:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:25,128 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-12-31 03:54:25,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:54:25,129 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-31 03:54:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:25,142 INFO L225 Difference]: With dead ends: 104 [2018-12-31 03:54:25,142 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 03:54:25,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:54:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 03:54:25,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-31 03:54:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 03:54:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2018-12-31 03:54:25,187 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2018-12-31 03:54:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:25,187 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2018-12-31 03:54:25,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:54:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2018-12-31 03:54:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 03:54:25,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:25,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:25,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:25,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash 331839487, now seen corresponding path program 1 times [2018-12-31 03:54:25,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:54:25,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:54:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:25,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:54:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:54:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:54:25,276 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:54:25,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:54:25 BoogieIcfgContainer [2018-12-31 03:54:25,310 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:54:25,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:54:25,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:54:25,311 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:54:25,312 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:24" (3/4) ... [2018-12-31 03:54:25,316 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:54:25,316 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:54:25,317 INFO L168 Benchmark]: Toolchain (without parser) took 1976.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 60.8 MB). Free memory was 951.4 MB in the beginning and 989.6 MB in the end (delta: -38.2 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:25,319 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:25,320 INFO L168 Benchmark]: CACSL2BoogieTranslator took 464.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:25,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 143.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 60.8 MB). Free memory was 935.2 MB in the beginning and 1.0 GB in the end (delta: -110.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:25,322 INFO L168 Benchmark]: Boogie Preprocessor took 52.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:25,323 INFO L168 Benchmark]: RCFGBuilder took 842.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:25,324 INFO L168 Benchmark]: TraceAbstraction took 462.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:25,324 INFO L168 Benchmark]: Witness Printer took 5.56 ms. Allocated memory is still 1.1 GB. Free memory is still 989.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:25,330 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 464.24 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 143.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 60.8 MB). Free memory was 935.2 MB in the beginning and 1.0 GB in the end (delta: -110.8 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 842.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 462.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 989.6 MB in the end (delta: 21.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 ms. Allocated memory is still 1.1 GB. Free memory is still 989.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 154]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 33, overapproximation of bitwiseAnd at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 153. Possible FailurePath: [L17] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L149] double x = -0.0; [L20] double z; [L21] __int32_t sign = 0x80000000; [L22] __uint32_t r, t1, s1, ix1, q1; [L23] __int32_t ix0, s0, q, m, t, i; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L26] ieee_double_shape_type ew_u; [L27] ew_u.value = (x) [L28] EXPR ew_u.parts.msw [L28] (ix0) = ew_u.parts.msw [L29] EXPR ew_u.parts.lsw [L29] (ix1) = ew_u.parts.lsw [L32] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L33] return x * x + x; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L150] double res = __ieee754_sqrt(x); [L153] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L153] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L154] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 73 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:54:27,860 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:54:27,862 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:54:27,885 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:54:27,885 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:54:27,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:54:27,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:54:27,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:54:27,891 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:54:27,892 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:54:27,893 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:54:27,893 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:54:27,894 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:54:27,895 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:54:27,896 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:54:27,897 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:54:27,898 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:54:27,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:54:27,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:54:27,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:54:27,905 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:54:27,906 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:54:27,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:54:27,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:54:27,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:54:27,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:54:27,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:54:27,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:54:27,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:54:27,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:54:27,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:54:27,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:54:27,916 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:54:27,916 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:54:27,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:54:27,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:54:27,918 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:54:27,937 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:54:27,938 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:54:27,939 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:54:27,939 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:54:27,939 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:54:27,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:54:27,943 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:54:27,943 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:54:27,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:54:27,944 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:54:27,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:54:27,945 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:54:27,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:54:27,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:54:27,945 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:54:27,947 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:54:27,947 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:54:27,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:27,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:54:27,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:54:27,948 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:54:27,948 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:54:27,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:54:27,949 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:54:27,949 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:54:27,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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.graphml 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(__VERIFIER_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 -> 788527977e7ebd7aa0a832758f41b65d3cbd270a [2018-12-31 03:54:27,995 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:54:28,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:54:28,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:54:28,017 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:54:28,017 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:54:28,018 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:28,091 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc812317a/e3a24ccecc784b0d93b632455a1f935e/FLAG2db71ef02 [2018-12-31 03:54:28,554 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:54:28,555 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:28,565 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc812317a/e3a24ccecc784b0d93b632455a1f935e/FLAG2db71ef02 [2018-12-31 03:54:28,882 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc812317a/e3a24ccecc784b0d93b632455a1f935e [2018-12-31 03:54:28,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:54:28,889 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:54:28,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:28,891 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:54:28,901 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:54:28,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:28" (1/1) ... [2018-12-31 03:54:28,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645063f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:28, skipping insertion in model container [2018-12-31 03:54:28,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:54:28" (1/1) ... [2018-12-31 03:54:28,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:54:28,949 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:54:29,286 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:29,292 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:54:29,340 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:54:29,377 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:54:29,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29 WrapperNode [2018-12-31 03:54:29,377 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:54:29,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:29,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:54:29,379 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:54:29,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:54:29,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:54:29,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:54:29,521 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:54:29,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... [2018-12-31 03:54:29,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:54:29,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:54:29,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:54:29,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:54:29,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:54:29,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:54:29,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:54:29,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:54:30,061 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:33,523 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:54:33,771 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:54:33,772 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:54:33,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:33 BoogieIcfgContainer [2018-12-31 03:54:33,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:54:33,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:54:33,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:54:33,779 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:54:33,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:54:28" (1/3) ... [2018-12-31 03:54:33,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22505445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:33, skipping insertion in model container [2018-12-31 03:54:33,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:54:29" (2/3) ... [2018-12-31 03:54:33,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22505445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:54:33, skipping insertion in model container [2018-12-31 03:54:33,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:33" (3/3) ... [2018-12-31 03:54:33,786 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0730b_true-unreach-call.c [2018-12-31 03:54:33,798 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:54:33,809 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:54:33,827 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:54:33,860 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:54:33,861 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:54:33,861 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:54:33,861 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:54:33,861 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:54:33,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:54:33,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:54:33,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:54:33,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:54:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-12-31 03:54:33,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-31 03:54:33,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:33,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:33,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:33,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:33,893 INFO L82 PathProgramCache]: Analyzing trace with hash 361085180, now seen corresponding path program 1 times [2018-12-31 03:54:33,897 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:54:33,897 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:54:33,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:34,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:54:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:34,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:54:34,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:34,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:54:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:54:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:54:34,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:54:34,439 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-12-31 03:54:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:34,462 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2018-12-31 03:54:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:54:34,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-12-31 03:54:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:34,476 INFO L225 Difference]: With dead ends: 104 [2018-12-31 03:54:34,476 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 03:54:34,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:54:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 03:54:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-31 03:54:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-31 03:54:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2018-12-31 03:54:34,518 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2018-12-31 03:54:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:34,519 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2018-12-31 03:54:34,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:54:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2018-12-31 03:54:34,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-31 03:54:34,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:34,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:34,521 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash 331839487, now seen corresponding path program 1 times [2018-12-31 03:54:34,522 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:54:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:54:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:54:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:34,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:54:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:35,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:54:35,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:35,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:54:35,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:54:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:54:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:54:35,025 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand 4 states. [2018-12-31 03:54:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:36,779 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-12-31 03:54:37,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:54:37,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-31 03:54:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:37,149 INFO L225 Difference]: With dead ends: 59 [2018-12-31 03:54:37,149 INFO L226 Difference]: Without dead ends: 17 [2018-12-31 03:54:37,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:54:37,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-31 03:54:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-31 03:54:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-31 03:54:37,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-31 03:54:37,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2018-12-31 03:54:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:37,156 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-31 03:54:37,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:54:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-31 03:54:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:54:37,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:37,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:37,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1929218748, now seen corresponding path program 1 times [2018-12-31 03:54:37,159 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:54:37,159 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:54:37,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:37,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:54:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:37,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:54:37,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:37,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:54:37,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:54:37,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:54:37,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:54:37,499 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2018-12-31 03:54:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:39,254 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-31 03:54:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:54:39,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-31 03:54:39,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:39,258 INFO L225 Difference]: With dead ends: 29 [2018-12-31 03:54:39,259 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:54:39,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:54:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:54:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-31 03:54:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-31 03:54:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-31 03:54:39,266 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2018-12-31 03:54:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:39,267 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-31 03:54:39,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:54:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-31 03:54:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:54:39,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:39,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:39,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:39,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 239121058, now seen corresponding path program 1 times [2018-12-31 03:54:39,270 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:54:39,270 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:54:39,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:40,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:54:40,299 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:54:40,300 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:54:40,302 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:54:40,303 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:54:40,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-12-31 03:54:40,474 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-12-31 03:54:40,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:54:40,533 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:54:40,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2018-12-31 03:54:40,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:54:40,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-12-31 03:54:40,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:54:40,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 26 [2018-12-31 03:54:40,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:54:40,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:54:40,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-12-31 03:54:40,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:54:40,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-12-31 03:54:40,775 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:54:40,859 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:54:40,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:54:41,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:54:41,150 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:77, output treesize:33 [2018-12-31 03:54:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:41,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:54:41,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:41,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:54:41,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:54:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:54:41,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:54:41,270 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 4 states. [2018-12-31 03:54:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:41,383 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-31 03:54:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:54:41,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:54:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:41,385 INFO L225 Difference]: With dead ends: 26 [2018-12-31 03:54:41,385 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 03:54:41,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:54:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 03:54:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-31 03:54:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 03:54:41,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-12-31 03:54:41,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 12 [2018-12-31 03:54:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:41,393 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-12-31 03:54:41,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:54:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-12-31 03:54:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:54:41,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:54:41,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:54:41,395 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:54:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:54:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash 264903321, now seen corresponding path program 1 times [2018-12-31 03:54:41,396 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:54:41,396 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:54:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:54:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:54:41,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:54:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:54:41,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:54:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:54:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 03:54:41,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:54:41,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:54:41,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:54:41,727 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 9 states. [2018-12-31 03:54:42,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:54:42,235 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-12-31 03:54:42,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:54:42,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-31 03:54:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:54:42,237 INFO L225 Difference]: With dead ends: 16 [2018-12-31 03:54:42,237 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:54:42,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-31 03:54:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:54:42,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:54:42,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:54:42,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:54:42,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-12-31 03:54:42,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:54:42,239 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:54:42,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:54:42,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:54:42,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:54:42,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:54:42,586 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-31 03:54:42,726 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-12-31 03:54:42,792 INFO L444 ceAbstractionStarter]: At program point L126(lines 19 127) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0) (= .cse0 ULTIMATE.start___ieee754_sqrt_~x) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_4|))) (and (= ((_ extract 31 0) v_prenex_7) ULTIMATE.start___ieee754_sqrt_~ix1~0) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse1) (= ((_ extract 63 32) v_prenex_7) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix1~0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)))) [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L85-2(lines 85 94) no Hoare annotation was computed. [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 55) no Hoare annotation was computed. [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L44-2(lines 44 55) no Hoare annotation was computed. [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-12-31 03:54:42,793 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 41) no Hoare annotation was computed. [2018-12-31 03:54:42,794 INFO L444 ceAbstractionStarter]: At program point L69-2(lines 69 79) the Hoare annotation is: false [2018-12-31 03:54:42,794 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 41) no Hoare annotation was computed. [2018-12-31 03:54:42,794 INFO L448 ceAbstractionStarter]: For program point L69-3(lines 69 79) no Hoare annotation was computed. [2018-12-31 03:54:42,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:54:42,794 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:54:42,794 INFO L444 ceAbstractionStarter]: At program point L45-2(lines 45 49) the Hoare annotation is: false [2018-12-31 03:54:42,794 INFO L448 ceAbstractionStarter]: For program point L45-3(lines 45 49) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L87(lines 87 88) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 120 125) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L153-2(lines 153 156) no Hoare annotation was computed. [2018-12-31 03:54:42,795 INFO L444 ceAbstractionStarter]: At program point L120-2(lines 120 125) the Hoare annotation is: false [2018-12-31 03:54:42,795 INFO L448 ceAbstractionStarter]: For program point L87-2(lines 87 88) no Hoare annotation was computed. [2018-12-31 03:54:42,796 INFO L448 ceAbstractionStarter]: For program point L120-3(lines 120 125) no Hoare annotation was computed. [2018-12-31 03:54:42,796 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 112) no Hoare annotation was computed. [2018-12-31 03:54:42,796 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 75) no Hoare annotation was computed. [2018-12-31 03:54:42,796 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 71 75) no Hoare annotation was computed. [2018-12-31 03:54:42,796 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 154) no Hoare annotation was computed. [2018-12-31 03:54:42,798 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-31 03:54:42,798 INFO L444 ceAbstractionStarter]: At program point L138(lines 129 139) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_q#valueAsBitvector_5|) ULTIMATE.start___signbit_double_~msw~0))) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res|) (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0) (= .cse0 ULTIMATE.start___ieee754_sqrt_~x) |ULTIMATE.start_main_#t~short11| (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_4|))) (and (= ((_ extract 31 0) v_prenex_7) ULTIMATE.start___ieee754_sqrt_~ix1~0) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse1) (= ((_ extract 63 32) v_prenex_7) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix1~0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)))) [2018-12-31 03:54:42,798 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2018-12-31 03:54:42,798 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:54:42,799 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:54:42,799 INFO L448 ceAbstractionStarter]: For program point L90-2(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:54:42,799 INFO L444 ceAbstractionStarter]: At program point L82-2(lines 82 98) the Hoare annotation is: false [2018-12-31 03:54:42,799 INFO L448 ceAbstractionStarter]: For program point L82-3(lines 19 127) no Hoare annotation was computed. [2018-12-31 03:54:42,799 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 112) no Hoare annotation was computed. [2018-12-31 03:54:42,799 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 132 136) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L444 ceAbstractionStarter]: At program point L132-2(lines 132 136) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (= |ULTIMATE.start___ieee754_sqrt_#res| .cse0) (= .cse0 ULTIMATE.start___ieee754_sqrt_~x) |ULTIMATE.start_main_#t~short11| (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64)) (v_prenex_7 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_4|))) (and (= ((_ extract 31 0) v_prenex_7) ULTIMATE.start___ieee754_sqrt_~ix1~0) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___ieee754_sqrt_~ix0~0 .cse1) (= ((_ extract 63 32) v_prenex_7) .cse1) (= ULTIMATE.start___ieee754_sqrt_~ix1~0 ((_ extract 31 0) |v_q#valueAsBitvector_4|))))) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32)))) [2018-12-31 03:54:42,800 INFO L448 ceAbstractionStarter]: For program point L132-3(lines 132 136) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 61) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 30) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L448 ceAbstractionStarter]: For program point L58-2(lines 58 61) no Hoare annotation was computed. [2018-12-31 03:54:42,800 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 30) the Hoare annotation is: (and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_sqrt_~x) (= (bvadd ULTIMATE.start___ieee754_sqrt_~sign~0 (_ bv2147483648 32)) (_ bv0 32))) [2018-12-31 03:54:42,801 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 19 127) no Hoare annotation was computed. [2018-12-31 03:54:42,801 INFO L448 ceAbstractionStarter]: For program point L50-2(lines 50 51) no Hoare annotation was computed. [2018-12-31 03:54:42,801 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 50 51) the Hoare annotation is: false [2018-12-31 03:54:42,801 INFO L448 ceAbstractionStarter]: For program point L50-4(lines 50 51) no Hoare annotation was computed. [2018-12-31 03:54:42,801 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 109) no Hoare annotation was computed. [2018-12-31 03:54:42,801 INFO L448 ceAbstractionStarter]: For program point L108-2(lines 108 109) no Hoare annotation was computed. [2018-12-31 03:54:42,802 INFO L448 ceAbstractionStarter]: For program point L100(lines 100 114) no Hoare annotation was computed. [2018-12-31 03:54:42,802 INFO L451 ceAbstractionStarter]: At program point L158(lines 141 159) the Hoare annotation is: true [2018-12-31 03:54:42,802 INFO L448 ceAbstractionStarter]: For program point L117(lines 117 118) no Hoare annotation was computed. [2018-12-31 03:54:42,802 INFO L448 ceAbstractionStarter]: For program point L117-2(lines 117 118) no Hoare annotation was computed. [2018-12-31 03:54:42,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,815 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,816 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,824 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,825 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,829 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,830 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,831 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,832 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,833 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:54:42 BoogieIcfgContainer [2018-12-31 03:54:42,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:54:42,845 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:54:42,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:54:42,845 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:54:42,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:54:33" (3/4) ... [2018-12-31 03:54:42,857 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:54:42,873 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 03:54:42,874 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-31 03:54:42,906 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-12-31 03:54:42,907 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-12-31 03:54:42,908 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists v_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_q#valueAsBitvector_5[63:32] == msw) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 1bv32 == \result) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 [2018-12-31 03:54:42,961 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:54:42,961 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:54:42,964 INFO L168 Benchmark]: Toolchain (without parser) took 14075.68 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 951.4 MB in the beginning and 892.8 MB in the end (delta: 58.5 MB). Peak memory consumption was 177.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,965 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:42,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 142.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,966 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:54:42,966 INFO L168 Benchmark]: RCFGBuilder took 4205.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,969 INFO L168 Benchmark]: TraceAbstraction took 9071.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,970 INFO L168 Benchmark]: Witness Printer took 116.62 ms. Allocated memory is still 1.1 GB. Free memory was 899.7 MB in the beginning and 892.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:54:42,976 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 486.83 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 142.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4205.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9071.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 899.7 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. * Witness Printer took 116.62 ms. Allocated memory is still 1.1 GB. Free memory was 899.7 MB in the beginning and 892.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 154]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 129]: Loop Invariant [2018-12-31 03:54:42,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:42,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:42,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:42,999 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:54:43,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((((((\exists v_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_q#valueAsBitvector_5[63:32] == msw) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && 1bv32 == \result) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 82]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 120]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 132]: Loop Invariant [2018-12-31 03:54:43,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (((((res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2018-12-31 03:54:43,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-12-31 03:54:43,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:54:43,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((\result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_q#valueAsBitvector_4 : bv64, v_prenex_7 : bv64 :: (((v_prenex_7[31:0] == ix1 && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0])) && ix0 == v_q#valueAsBitvector_4[63:32]) && v_prenex_7[63:32] == v_q#valueAsBitvector_4[63:32]) && ix1 == v_q#valueAsBitvector_4[31:0])) && ~bvadd64(sign, 2147483648bv32) == 0bv32 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. SAFE Result, 8.9s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 117 SDtfs, 108 SDslu, 54 SDs, 0 SdLazy, 57 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 15 NumberOfFragments, 182 HoareAnnotationTreeSize, 10 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 50 ConstructedInterpolants, 8 QuantifiedInterpolants, 3353 SizeOfPredicates, 25 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...